1736 search results - page 28 / 348 » The rank-width of Directed Graphs |
142
click to vote
ECCC
2006
15 years 3 months ago
2006
We present two new methods for finding a lowest common ancestor (LCA) for each pair of vertices of a directed acyclic graph (dag) on n vertices and m edges. The first method is su...
135
click to vote
CATS
2006
15 years 5 months ago
2006
A complete description and proof of correctness are given for a new polynomial time algorithm for a class of codes based on directed graphs and involving construction well known i...
130
Voted
WDAG
2000
Springer
15 years 7 months ago
2000
Springer
A graph G with n vertices and maximum degree G cannot be given weak sense of direction using less than G colours. It is known that n colours are always sufficient, and it was conje...
134
Voted
AUIC
2006
IEEE
15 years 9 months ago
2006
IEEE
We describe a prototype sketch-based system that allows users to draw and manipulate directed graphs using gestural input exclusively. The system incorporates the notion of fluid...