2612 search results - page 22 / 523 » Switching Graphs and Their Complexity |
IPL
2008
13 years 9 months ago
2008
We prove that on prefix-recognizable graphs reachability is complete for deterministic exponential time matching the complexity of alternating reachability. Key words: Reachabilit...
SPAA
1997
ACM
14 years 2 months ago
1997
ACM
: This paper presents a network mapping algorithm and proves its correctness assuming a traffic-free network. Respecting well-defined parameters, the algorithm produces a graph iso...
WADS
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Edge casing is a well-known method to improve the readability of drawings of non-planar graphs. A cased drawing orders the edges of each edge crossing and interrupts the ...
ISSS
1997
IEEE
14 years 2 months ago
1997
IEEE
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases . There exists some tools that give an o...
TCS
2008
13 years 9 months ago
2008
We consider computational complexity questions related to parallel knock-out schemes for graphs. In such schemes, in each round, each remaining vertex of a given graph eliminates ...