2487 search results - page 298 / 498 » Partitions of Graphs into Trees |
145
click to vote
ALGORITHMICA
1998
15 years 3 months ago
1998
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
144
Voted
SAC
2006
ACM
15 years 9 months ago
2006
ACM
This paper introduces the MTree index algorithm, a special purpose XML XPath index designed to meet the needs of the hierarchical XPath query language. With the increasing importa...
130
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
122
Voted
SEMWEB
2007
Springer
15 years 9 months ago
2007
Springer
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
150
click to vote
TEC
2002
15 years 3 months ago
2002
Abstract--In this paper, we present an efficient graph-based evolutionary optimization technique called evolutionary graph generation (EGG) and the proposed approach is applied to ...