Sciweavers

355 search results - page 48 / 71
» On Central Spanning Trees of a Graph
Sort
View
COCOON
1999
Springer
15 years 2 months ago
An External Memory Data Structure for Shortest Path Queries
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...
David A. Hutchinson, Anil Maheshwari, Norbert Zeh
SOFSEM
1997
Springer
15 years 2 months ago
Time Optimal Self-Stabilizing Algorithms
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
Rastislav Kralovic
SIAMDM
2010
117views more  SIAMDM 2010»
14 years 8 months ago
Design is as Easy as Optimization
We consider the class of max-min and min-max optimization problems subject to a global budget (or weight) constraint and we undertake a systematic algorithmic and complexitytheore...
Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vaz...
IPCO
2010
184views Optimization» more  IPCO 2010»
14 years 11 months ago
Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...
Takuro Fukunaga
JGT
2008
150views more  JGT 2008»
14 years 9 months ago
Cycle spaces in topological spaces
: We develop a general model of edge spaces in order to generalize, unify, and simplify previous work on cycle spaces of infinite graphs. We give simple topological criteria to sho...
Antoine Vella, R. Bruce Richter