Sciweavers

2283 search results - page 20 / 457
» Bounds of Graph Characteristics
Sort
View
CORR
2004
Springer
111views Education» more  CORR 2004»
13 years 7 months ago
Layout of Graphs with Bounded Tree-Width
A queue layout of a graph consists of a total order of the vertices, and a partition of the edges into queues, such that no two edges in the same queue are nested. The minimum numb...
Vida Dujmovic, Pat Morin, David R. Wood
ICALP
1995
Springer
13 years 11 months ago
Parallel Algorithms with Optimal Speedup for Bounded Treewidth
We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algori...
Hans L. Bodlaender, Torben Hagerup
DAM
2008
134views more  DAM 2008»
13 years 7 months ago
Efficient algorithms for finding critical subgraphs
This paper presents algorithms to find vertex-critical and edgecritical subgraphs in a given graph G, and demonstrates how these critical subgraphs can be used to determine the ch...
Christian Desrosiers, Philippe Galinier, Alain Her...
JNSM
2006
78views more  JNSM 2006»
13 years 7 months ago
Edge-Cut Bounds on Network Coding Rates
Two bounds on network coding rates are reviewed that generalize edge-cut bounds on routing rates. The simpler bound is a bidirected cut-set bound which generalizes and improves upo...
Gerhard Kramer, Serap A. Savari
VALUETOOLS
2006
ACM
166views Hardware» more  VALUETOOLS 2006»
14 years 1 months ago
Web graph analyzer tool
We present the software tool “Web Graph Analyzer”. This tool is designed to perform a comprehensive analysis of the Web Graph structure. By Web Graph we mean a graph whose ver...
Konstantin Avrachenkov, Danil Nemirovsky, Natalia ...