1545 search results - page 140 / 309 » On tree congestion of graphs |
ICPR
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, a new graph data structure for 2-D shape representation is proposed. The new structure is called a concavity graph, and is an evolution from the already known "...
GBRPR
2007
Springer
15 years 4 months 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...
SIGMOD
2010
ACM
15 years 2 months ago
2010
ACM
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
102
click to vote
KDD
2004
ACM
15 years 10 months ago
2004
ACM
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
JGT
2008
14 years 10 months ago
2008
Given a distribution of pebbles on the vertices of a graph G, a pebbling move takes two pebbles from one vertex and puts one on a neighboring vertex. The pebbling number (G) is th...