60 search results - page 3 / 12 » A Separator Theorem for String Graphs and its Applications |
138
click to vote
JCT
2007
15 years 4 months ago
2007
An edge in a drawing of a graph is called even if it intersects every other edge of the graph an even number of times. Pach and T´oth proved that a graph can always be redrawn so...
135
click to vote
ESA
1999
Springer
15 years 8 months ago
1999
Springer
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
166
click to vote
STACS
1992
Springer
15 years 8 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
141
click to vote
MFCS
2005
Springer
15 years 9 months ago
2005
Springer
Due to extensive research on tree-width for undirected graphs and due to its many applications in various fields it has been a natural desire for many years to generalize the idea...
128
click to vote
HYBRID
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In this paper, we consider the problem of generating optimized, executable control code from high-level, symbolic specifications. In particular, we construct symbolic co...