Sciweavers

1736 search results - page 37 / 348
» The rank-width of Directed Graphs
Sort
View
41
Voted
CORR
2007
Springer
49views Education» more  CORR 2007»
15 years 16 days ago
The rank-width of Directed Graphs
Mamadou Moustapha Kanté
76
Voted
JGAA
2008
45views more  JGAA 2008»
15 years 16 days ago
Using a Significant Spanning Tree to Draw a Directed Graph
Martin Harrigan, Patrick Healy
JEA
2006
85views more  JEA 2006»
15 years 15 days ago
A dynamic topological sort algorithm for directed acyclic graphs
David J. Pearce, Paul H. J. Kelly
77
Voted
ORDER
2008
54views more  ORDER 2008»
15 years 15 days ago
Word Problem of the Perkins Semigroup via Directed Acyclic Graphs
Sergey Kitaev, Steve Seif
SIAMDM
2008
101views more  SIAMDM 2008»
15 years 14 days ago
Hamilton Cycles in Random Lifts of Directed Graphs
An n-lift of a digraph K, is a digraph with vertex set V (K)
Prasad Chebolu, Alan M. Frieze