3105 search results - page 81 / 621 » The Path-Packing Structure of Graphs |
150
click to vote
WADS
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Algorithms or target functions for graph clustering rarely admit quality guarantees or optimal results in general. Based on properties of minimum-cut trees, a clustering ...
117
click to vote
DAM
2006
15 years 3 months ago
2006
In a previous work, we proposed a new integer programming formulation for the graph coloring problem which, to a certain extent, avoids symmetry. We studied the facet structure of...
115
click to vote
ENTCS
2002
15 years 2 months ago
2002
This work is part of the Fujaba project. The Fujaba project aims to use the Unified Modeling Language UML as a programmed graph rewriting language. This paper describes the new gr...
113
click to vote
JGT
2010
15 years 1 months ago
2010
While finite cop-win finite graphs possess a good structural characterization, none is known for infinite cop-win graphs. As evidence that such a characterization might not exis...
159
click to vote
TGC
2010
Springer
15 years 1 months ago
2010
Springer
We define an algebraic theory of hierarchical graphs, whose axioms characterise graph isomorphism: two terms are equated exactly when they represent the same graph. Our algebra can...