1736 search results - page 52 / 348 » The rank-width of Directed Graphs |
117
click to vote
IJKDB
2010
15 years 1 months ago
2010
Searching for repeated features characterizing biological data is fundamental in computational biology. When biological networks are under analysis, the presence of repeated modul...
130
Voted
CORR
2002
Springer
15 years 3 months ago
2002
Springer
We introduce a new approach for drawing diagrams. Our approach is to use a technique we call confluent drawing for visualizing non-planar graphs in a planar way. This approach all...
153
Voted
TEC
2002
15 years 3 months ago
2002
Abstract--In this paper, we present an efficient graph-based evolutionary optimization technique called evolutionary graph generation (EGG) and the proposed approach is applied to ...
162
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
163
Voted
ICDM
2010
IEEE
15 years 1 months ago
2010
IEEE
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...