5100 search results - page 370 / 1020 » The Linear Complexity of a Graph |
126
click to vote
CSL
2006
Springer
15 years 10 months ago
2006
Springer
The synthesis of reactive systems requires the solution of two-player games on graphs with -regular objectives. When the objective is specified by a linear temporal logic formula o...
168
click to vote
GD
2006
Springer
15 years 10 months ago
2006
Springer
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...
159
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We obtain improved upper bounds and new lower bounds on the chromatic number as a linear function of the clique number, for the intersection graphs (and their complements) of fini...
151
click to vote
DAM
2007
15 years 6 months ago
2007
We prove that local complementation and vertex deletion, operations from which vertexminors are defined, can simulate edge contractions. As an application, we prove that the rank...
152
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...