1736 search results - page 72 / 348 » The rank-width of Directed Graphs |
146
click to vote
BIRTHDAY
2005
Springer
15 years 6 months ago
2005
Springer
Software engineers usually represent problems and solutions aph-based notations at different levels of abstractions. These notations are often semi-formal, but the use of graph tr...
114
click to vote
WADS
2001
Springer
15 years 8 months ago
2001
Springer
In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization...
234
click to vote
ISCA
2002
IEEE
15 years 3 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
145
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
In a previous work we introduced slice graphs as a way to specify both infinite languages of directed acyclic graphs (DAGs) and infinite languages of partial orders. Therein we fo...
132
click to vote
ARSCOM
1998
15 years 3 months ago
1998
Some results relating to the road-coloring conjecture of Alder, Goodwyn, and Weiss, which give rise to an O(n2) algorithm to determine whether or not a given edge-coloring of a gra...