3105 search results - page 212 / 621 » The Path-Packing Structure of Graphs |
132
click to vote
JCT
2008
15 years 3 months ago
2008
Let M denote the Laplacian matrix of a graph G. Associated with G is a finite group (G), obtained from the Smith normal form of M, and whose order is the number of spanning trees o...
151
click to vote
JCT
2007
15 years 3 months ago
2007
We give a new upper bound for the rectilinear crossing number cr(n) of the complete geometric graph Kn. We prove that cr(n) ≤ 0.380559 ¡n 4 ¢ + Θ(n3 ) by means of a new const...
101
click to vote
CORR
2002
Springer
15 years 3 months ago
2002
Springer
Treebank formats and associated software tools are proliferating rapidly, with little consideration for interoperability. We survey a wide variety of treebank structures and opera...
151
click to vote
LATA
2009
Springer
15 years 10 months ago
2009
Springer
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
154
click to vote
KR
2004
Springer
15 years 9 months ago
2004
Springer
One of the major advances in classical planning has been the development of Graphplan. Graphplan builds a layered structure called the planning graph, and then searches this struc...