1729 search results - page 30 / 346 » On Bounds for the k-Partitioning of Graphs |
WG
2007
Springer
15 years 3 months ago
2007
Springer
Kelly-width is a parameter of directed graphs recently proposed by Hunter and Kreutzer as a directed analogue of treewidth. We give several alternative characterizations of direct...
DM
2008
14 years 10 months ago
2008
The coefficient of fragmentability of a class of graphs measures the proportion of vertices that need to be removed from the graphs in the class in order to leave behind bounded s...
102
click to vote
IPL
2008
14 years 9 months ago
2008
We use transfer matrix methods to determine bounds for the numbers of legal Go positions for various numbers of players on some planar lattice graphs, including square lattice gra...
COLOGNETWENTE
2009
14 years 11 months ago
2009
A graph parameter is self-dual in some class of graphs embeddable in some surface if its value does not change in the dual graph more than a constant factor. Self-duality has been...
117
click to vote
CORR
2012
Springer
13 years 5 months ago
2012
Springer
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...