Sciweavers

4 search results - page 1 / 1
» Sandpile groups and spanning trees of directed line graphs
Sort
View
JCT
2011
83views more  JCT 2011»
12 years 11 months ago
Sandpile groups and spanning trees of directed line graphs
Abstract. We generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G and its directed line graph LG. The sandpile group is an abelian group associa...
Lionel Levine
ISAAC
2004
Springer
137views Algorithms» more  ISAAC 2004»
13 years 10 months ago
The Polymatroid Steiner Problems
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
Gruia Calinescu, Alexander Zelikovsky
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
13 years 11 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
COCOA
2009
Springer
13 years 9 months ago
On Open Rectangle-of-Influence Drawings of Planar Graphs
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
Huaming Zhang, Milind Vaidya