523 search results - page 42 / 105 » Decidability of string graphs |
117
Voted
COCO
2007
Springer
15 years 9 months ago
2007
Springer
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
153
click to vote
ALGORITHMICA
2011
14 years 10 months ago
2011
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...
118
Voted
APPROX
2007
Springer
15 years 9 months ago
2007
Springer
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
179
Voted
ICTAI
2008
IEEE
15 years 10 months ago
2008
IEEE
Frequent patterns in program executions represent recurring sequences of events. These patterns can be used to reveal the hidden structures of a program, and ease the comprehensio...
143
click to vote
IANDC
2007
15 years 3 months ago
2007
We investigate the complexity and expressive power of a spatial logic for reasoning about graphs. This logic was previously introduced by Cardelli, Gardner and Ghelli, and provide...