1736 search results - page 17 / 348 » The rank-width of Directed Graphs |
121
Voted
WABI
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. The orientation of physical networks is a prime task in deciphering the signaling-regulatory circuitry of the cell. One manifestation of this computational task is as a m...
121
click to vote
CORR
2012
Springer
13 years 8 months ago
2012
Springer
Graphs and networks are used to model interactions in a variety of contexts, and there is a growing need to be able to quickly assess the qualities of a graph in order to understa...
108
Voted
DM
2007
15 years 14 days ago
2007
An upper bound for the domination number of the direct product of graphs is proved. It in particular implies that for any graphs G and H, γ(G × H) ≤ 3γ(G)γ(H). Graphs with a...
97
Voted
ESA
2009
Springer
15 years 7 months ago
2009
Springer
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...
100
click to vote
CMSB
2006
Springer
15 years 4 months ago
2006
Springer
Having in mind the large-scale analysis of gene regulatory networks, we review a graph decimation algorithm, called "leaf-removal", which can be used to evaluate the feed...