1232 search results - page 1 / 247 » Digraphs: theory, algorithms and applications |
STVR
2002
13 years 4 months ago
2002
APPROX
2004
Springer
13 years 10 months ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
WG
2009
Springer
13 years 11 months ago
2009
Springer
Chordal graphs, also called triangulated graphs, are important in algorithmic graph theory. In this paper we generalise the definition of chordal graphs to the class of directed ...
JCT
1998
13 years 4 months ago
1998
The aim of this note is to point out some combinatorial applications of a lemma of Scarf, proved first in the context of game theory. The usefulness of the lemma in combinatorics...
DAGSTUHL
2007
13 years 6 months ago
2007