199 search results - page 12 / 40 » Connectivity of addable graph classes |
IICS
2003
Springer
14 years 23 days ago
2003
Springer
Both human users and crawlers face the problem of finding good start pages to explore some topic. We show how to assist in qualifying pages as start nodes by link-based ranking al...
COMBINATORICS
2007
13 years 7 months ago
2007
We present an infinite family of 3-connected non-bipartite graphs with chromatic roots in the interval (1, 2) thus resolving a conjecture of Jackson’s in the negative. In addit...
GD
2009
Springer
14 years 5 days ago
2009
Springer
The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is pla...
PVLDB
2010
13 years 6 months ago
2010
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often to...
APVIS
2007
13 years 9 months ago
2007
A straight-line grid drawing of a planar graph G is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segm...