25 search results - page 3 / 5 » Subdivisions of graphs: A generalization of paths and cycles |
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
120
click to vote
CORR
2004
Springer
14 years 11 months ago
2004
Springer
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
119
click to vote
SODA
1992
ACM
15 years 24 days ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
107
click to vote
SIAMCOMP
2000
14 years 11 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
COCOON
2007
Springer
15 years 5 months ago
2007
Springer
We introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a uni...