1370 search results - page 151 / 274 » On grids in topological graphs |
115
click to vote
GBRPR
2007
Springer
16 years 18 days ago
2007
Springer
In this paper, we propose a highly robust point-matching method (Graph Transformation Matching - GTM) relying on finding the consensus graph emerging from putative matches. Such m...
160
click to vote
IADIS
2008
15 years 7 months ago
2008
We present how to efficiently mine a set of directed acyclic graphs (DAGs) for unconnected, both multi- or single-rooted, and induced fragments. With a new canonical form that is ...
173
click to vote
COMBINATORICA
2006
15 years 6 months ago
2006
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...
159
click to vote
GC
2006
Springer
15 years 6 months ago
2006
Springer
A map is a connected topological graph cellularly embedded in a surface. For a given graph , its genus distribution of rooted maps and embeddings on orientable and non-orientable s...
150
click to vote
CDC
2008
IEEE
16 years 28 days ago
2008
IEEE
— We take a structural approach to the problem of designing the edge weights in an undirected graph subject to an upper bound on their total, so as to maximize the algebraic conn...