320 search results - page 27 / 64 » Parity Problems in Planar Graphs |
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We also show that -precision graphs are planar for > 1/ 2 and give a dichotomy theorem f...
CATS
2008
13 years 9 months ago
2008
Given an undirected graph with edge weights, we are asked to find an orientation, i.e., an assignment of a direction to each edge, so as to minimize the weighted maximum outdegree...
STACS
2000
Springer
13 years 11 months ago
2000
Springer
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We consider the problem of designing succinct representations of labeled graphs (we consider vertex labeled planar triangulations, as well as edge labeled planar graphs a...
SIBGRAPI
2005
IEEE
14 years 1 months ago
2005
IEEE
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...