3105 search results - page 400 / 621 » The Path-Packing Structure of Graphs |
108
click to vote
GBRPR
2005
Springer
15 years 9 months ago
2005
Springer
Graph pyramids are often used for representing irregular image pyramids. For the 2D case, combinatorial pyramids have been recently defined in order to explicitly represent more ...
126
click to vote
ADAEUROPE
2004
Springer
15 years 9 months ago
2004
Springer
The tree width of a graph G measures how close G is to being a tree or a series-parallel graph. Many well-known problems that are otherwise NP-complete can be solved efficiently if...
122
click to vote
CPAIOR
2004
Springer
15 years 9 months ago
2004
Springer
ng Abstractions for Local Search Pascal Van Hentenryck1 and Laurent Michel2 1 Brown University, Box 1910, Providence, RI 02912 2 University of Connecticut, Storrs, CT 06269-3155 Ab...
148
click to vote
ESA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...
141
click to vote
SOFTVIS
2003
ACM
15 years 9 months ago
2003
ACM
UML diagrams have become increasingly important in the engineering and reengineering processes for software systems. Of particular interest are UML class diagrams whose purpose is...