1729 search results - page 63 / 346 » Bound Graph Polysemy |
141
click to vote
JSYML
2010
14 years 11 months ago
2010
For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler...
185
click to vote
DIALM
2003
ACM
15 years 10 months ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
127
click to vote
SOFSEM
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Treewidth is a graph parameter with several interesting theoretical and practical applications. This survey reviews algorithmic results on determining the treewidth of a ...
145
click to vote
DAM
2007
15 years 4 months ago
2007
The packing chromatic number χρ(G) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into packings with pairwise different widths. Several...
133
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Motivated by applications in social networks, peer-to-peer and overlay networks, we define and study the Bounded Budget Connection (BBC) game - we have a collection of n players o...