1736 search results - page 61 / 348 » The rank-width of Directed Graphs |
124
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
For an acyclic directed graph with multiple sources and multiple sinks, we prove that one can choose the Menger's paths between the sources and the sinks such that the number...
137
click to vote
JUCS
2008
15 years 4 months ago
2008
: This paper1 presents an instruction scheduling algorithm based on the Subgraph Isomorphism Problem. Given a Directed Acyclic Graph (DAG) G1, our algorithm looks for a subgraph G2...
147
click to vote
SSD
2007
Springer
15 years 10 months ago
2007
Springer
The notion of a map is a fundamental metaphor in spatial disciplines. However, there currently exist no adequate data models for maps that define a precise spatial data type for m...
152
click to vote
CORR
2012
Springer
13 years 11 months ago
2012
Springer
The notions of subgraph centrality and communicability, based on the exponential of the adjacency matrix of the underlying graph, have been effectively used in the analysis of und...
127
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...