Sciweavers

2463 search results - page 46 / 493
» Rankings of Directed Graphs
Sort
View
EJC
2007
13 years 9 months ago
Representations of directed strongly regular graphs
We develop a theory of representations in Rm for directed strongly regular graphs, which gives a new proof of a nonexistence condition of Jørgensen [8]. We also describe some new...
Chris D. Godsil, Sylvia A. Hobart, William J. Mart...
CORR
2011
Springer
173views Education» more  CORR 2011»
13 years 3 months ago
Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter*n*log(n)) Time
We develop a new technique for computing maximum flow in directed planar graphs with multiple sources and a single sink that significantly deviates from previously known techniqu...
Philip N. Klein, Shay Mozes
UAI
2003
13 years 10 months ago
Layerwidth: Analysis of a New Metric for Directed Acyclic Graphs
We analyze a new property of directed acyclic graphs (DAGs), called layerwidth, arising from a class of DAGs proposed by Eiter and Lukasiewicz. This class of DAGs permits certain ...
Mark Hopkins
LPAR
2004
Springer
14 years 2 months ago
Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
Dietmar Berwanger, Erich Grädel
SODA
2007
ACM
131views Algorithms» more  SODA 2007»
13 years 10 months ago
On the K-simple shortest paths problem in weighted directed graphs
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...
Liam Roditty