3396 search results - page 58 / 680 » Tree representations of graphs |
MCS
2011
Springer
13 years 3 months ago
2011
Springer
: The modeling of a fully populated 3D tree able to regulate dynamically remains a relatively unexplored field. A non-dimensional representation of “autoregulation” coupled wit...
SWAT
1990
Springer
14 years 26 days ago
1990
Springer
We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log (m, n) + k2...
DM
2000
13 years 8 months ago
2000
A graph is said to be representable modulo n if its vertices can be labelled with distinct integers between 0 and n - 1 inclusive such that two vertices are adjacent if and only i...
WALCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
Treewidth and pathwidth are important graph parameters that represent how close the graph is to trees and paths respectively. We calculate treewidth and pathwidth on parameterized ...
DAM
2010
13 years 9 months ago
2010
Rank-width is a structural graph measure introduced by Oum and Seymour and aimed at better handling of graphs of bounded clique-width. We propose a formal mathematical framework an...