55 search results - page 7 / 11 » A Simple MAX-CUT Algorithm for Planar Graphs |
ECCC
2010
13 years 4 months ago
2010
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
JCO
1998
13 years 7 months ago
1998
We consider traveling salesman problems (TSPs) with a permuted Monge matrix as cost matrix where the associated patching graph has a specially simple structure: a multistar, a mult...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
VMV
2003
13 years 8 months ago
2003
Many applications, ranging from visualization applications such as architectural walkthroughs to robotic applications such as surveillance, could benefit from an automatic camera ...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...