25 search results - page 2 / 5 » Subdivisions of graphs: A generalization of paths and cycles |
CORR
2012
Springer
12 years 1 months ago
2012
Springer
Let G be a directed graph with n vertices and non-negative weights in its directed edges, embedded on a surface of genus g, and let f be an arbitrary face of G. We describe an alg...
FSTTCS
2008
Springer
13 years 6 months ago
2008
Springer
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...
DM
2000
13 years 5 months ago
2000
Erdos proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. Generalized graph coloring d...
COMPGEOM
2010
ACM
13 years 10 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
ICDM
2005
IEEE
13 years 11 months ago
2005
IEEE
Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole toolbox of data mining algorithms becomes available b...