641 search results - page 39 / 129 » On Planar Quasi-Parity Graphs |
111
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
120
click to vote
FOCS
2008
IEEE
15 years 8 months ago
2008
IEEE
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...
125
click to vote
GD
2006
Springer
15 years 5 months ago
2006
Springer
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar...
FOCS
2007
IEEE
15 years 8 months ago
2007
IEEE
We show for several planar and geometric problems that the best known approximation schemes are essentially optimal with respect to the dependence on ǫ. For example, we show that...
112
click to vote
GD
2005
Springer
15 years 7 months ago
2005
Springer
A clustered graph has its vertices grouped into clusters in a hierarchical way via subset inclusion, thereby imposing a tree structure on the clustering relationship. The c-planari...