136 search results - page 14 / 28 » Crossing and Weighted Crossing Number of Near-Planar Graphs |
COCOON
2006
Springer
13 years 11 months ago
2006
Springer
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
ISCAS
1999
IEEE
13 years 12 months ago
1999
IEEE
The bigraph crossing problem, embedding the two node sets of a bipartite graph G = V0;V1;E along two parallel lines so that edge crossings are minimized, has application to placeme...
JGAA
2000
13 years 7 months ago
2000
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
ENDM
2007
13 years 7 months ago
2007
In this paper we investigate how certain results related to the HananiTutte theorem can be extended from the plane to surfaces. We give a simple topological proof that the weak Ha...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...