User Andrew D. King

Andrew D. King

Member for 11 years, 7 months
Last seen more than 1 year ago

andrewdouglasking.com
Vancouver, Canada

16 Answers

Score Activity Newest

14 votes

NP-hard problems on trees

answered Nov 9, 2012 at 19:14

11 votes

Conjectures implying Four Color Theorem

graph-theory co.combinatorics big-list graph-colouring

answered Mar 26, 2011 at 1:22

11 votes

Accepted

Any relation between the size of maximum independent set and the chromatic number on graph of bounded degree?

graph-theory co.combinatorics graph-colouring

answered Jun 13, 2011 at 12:05

10 votes

Is feedback vertex set problem is solvable in polynomial time for some special graph

cc.complexity-theory graph-algorithms

answered Mar 14, 2011 at 20:40

8 votes

Accepted

Is it enough to sort for polynomially many 0-1 sequences for a sorting network?

ds.algorithms sorting sorting-network

answered Mar 3, 2015 at 0:45

6 votes

Accepted

Decomposition by Clique Separators

ds.algorithms graph-theory graph-algorithms separation

answered Jul 6, 2012 at 16:55

5 votes

Approximate graph colouring with a promised upper bound on maximum independent set

ds.algorithms graph-algorithms approximation-algorithms graph-colouring

answered Oct 19, 2011 at 19:20

5 votes

Accepted

How to find the first $k$ points of high enough level using a priority search tree?

ds.data-structures cg.comp-geom

answered Apr 6, 2013 at 20:46

5 votes

Accepted

Finding balanced disjoint cycles in bridgeless cubic graphs

cc.complexity-theory graph-theory

answered Dec 12, 2013 at 19:10

4 votes

Accepted

Given a network flow, are there bounds on the change in weight on nodes?

ds.algorithms graph-theory application-of-theory network-modeling

answered Apr 3, 2011 at 15:39

4 votes

Is there a direct/natural reduction to count non-bipartite perfect matchings using the permanent?

graph-theory counting-complexity reductions permanent

answered Nov 23, 2010 at 20:29

4 votes

Accepted

Combinatorial Independent set Algorithms for sub-classes of perfect graphs

ds.algorithms graph-theory graph-algorithms

answered Mar 7, 2011 at 5:52

3 votes

Accepted

Max-cut equivalence with most likely assignment to an Ising model

graph-theory approximation

answered Feb 18, 2015 at 1:48

2 votes

Minimum maximal solutions of LPs

cc.complexity-theory ds.algorithms reference-request linear-programming optimization

answered Jan 11, 2011 at 17:21

2 votes

Maximum-clique practical applications

ds.algorithms graph-theory application-of-theory clique

answered Oct 6, 2011 at 17:50

1 vote

Sorting array of distances by proximity to each other

cg.comp-geom sorting

answered Dec 8, 2010 at 20:51

Stack Exchange Network

current community

your communities

more stack exchange communities

16 Answers

NP-hard problems on trees

Conjectures implying Four Color Theorem

Any relation between the size of maximum independent set and the chromatic number on graph of bounded degree?

Is feedback vertex set problem is solvable in polynomial time for some special graph

Is it enough to sort for polynomially many 0-1 sequences for a sorting network?

Decomposition by Clique Separators

Approximate graph colouring with a promised upper bound on maximum independent set

How to find the first $k$ points of high enough level using a priority search tree?

Finding balanced disjoint cycles in bridgeless cubic graphs

Given a network flow, are there bounds on the change in weight on nodes?

Is there a direct/natural reduction to count non-bipartite perfect matchings using the permanent?

Combinatorial Independent set Algorithms for sub-classes of perfect graphs

Max-cut equivalence with most likely assignment to an Ising model

Minimum maximal solutions of LPs

Maximum-clique practical applications

Sorting array of distances by proximity to each other