1232 search results - page 1 / 247 » Digraphs: theory, algorithms and applications |
77
Voted
STVR
2002
15 years 21 days ago
2002
98
Voted
APPROX
2004
Springer
15 years 6 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 ...
112
Voted
WG
2009
Springer
15 years 7 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 ...
103
Voted
JCT
1998
15 years 22 days 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
15 years 2 months ago
2007