212 search results - page 32 / 43 » Subgraph Isomorphism in Planar Graphs and Related Problems |
107
click to vote
WADS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We introduce the simultaneous representation problem, defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two...
102
Voted
GD
2003
Springer
15 years 5 months ago
2003
Springer
In this paper we consider the problem of drawing a planar graph using circular arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of points in t...
JDA
2007
15 years 14 days ago
2007
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...
136
Voted
ALT
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Assume we are given a sample of points from some underlying distribution which contains several distinct clusters. Our goal is to construct a neighborhood graph on the sa...
104
Voted
CORR
2010
Springer
15 years 20 days ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...