169 search results - page 26 / 34 » On Graph Crossing Number and Edge Planarization |
AINA
2010
IEEE
15 years 5 months ago
2010
IEEE
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...
128
click to vote
PKDD
2009
Springer
15 years 7 months ago
2009
Springer
We propose a new, recursive model to generate realistic graphs, evolving over time. Our model has the following properties: it is (a) flexible, capable of generating the cross pro...
135
click to vote
ENDM
2007
15 years 11 days 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...
119
Voted
COCO
2008
Springer
15 years 2 months ago
2008
Springer
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
105
Voted
FSTTCS
2009
Springer
15 years 7 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...