99 search results - page 14 / 20 » Labeling planar graphs with a condition at distance two |
148
click to vote
ICDM
2008
IEEE
16 years 1 months ago
2008
IEEE
In graph mining, a frequency measure is anti-monotonic if the frequency of a pattern never exceeds the frequency of a subpattern. The efficiency and correctness of most graph pat...
198
click to vote
SOFSEM
2007
Springer
16 years 24 days ago
2007
Springer
In this paper we deal with making drawings of clustered hierarchical graphs nicer. Given a planar graph G = (V, E) with an assignment of the vertices to horizontal layers, a plane ...
202
click to vote
ECCV
2004
Springer
16 years 8 months ago
2004
Springer
In recent work, we presented a framework for many-to-many matching of multi-scale feature hierarchies, in which features and their relations were captured in a vertex-labeled, edge...
149
click to vote
DAM
2008
15 years 6 months ago
2008
The NP-complete Closest 4-Leaf Power problem asks, given an undirected graph, whether it can be modified by at most r edge insertions or deletions such that it becomes a 4-leaf po...
168
click to vote
SASO
2008
IEEE
16 years 1 months ago
2008
IEEE
Many self-organizing and self-adaptive systems use the biologically inspired “gradient” primitive, in which each device in a network estimates its distance to the closest devi...