1729 search results - page 6 / 346 » Bound Graph Polysemy |
147
click to vote
COMGEO
2007
ACM
15 years 2 months ago
2007
ACM
The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. We prove that for Δ 5 and all large n, there is a Δ-reg...
145
Voted
STOC
2010
ACM
15 years 7 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
114
click to vote
TALG
2008
15 years 2 months ago
2008
We provide an algorithm listing all minimal dominating sets of a graph on n vertices in
113
Voted
RANDOM
2001
Springer
15 years 7 months ago
2001
Springer
d Abstract) Noga Alon1, , Michael Capalbo2, , Yoshiharu Kohayakawa3, , Vojtˇech R¨odl4,† , Andrzej Ruci´nski5,‡ , and Endre Szemer´edi6,§ 1 Department of Mathematics, Raym...
133
click to vote
CORR
2012
Springer
13 years 10 months ago
2012
Springer
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...