104 search results - page 7 / 21 » Comparative Graph Theoretical Characterization of Networks o... |
108
click to vote
BMCBI
2011
14 years 6 months ago
2011
Background: The number of gene sequences that are available for comparative genomics approaches is increasing extremely quickly. A current challenge is to be able to handle this h...
118
click to vote
CORR
2006
Springer
14 years 11 months ago
2006
Springer
We provide a tight approximate characterization of the n-dimensional product multicommodity flow (PMF) region for a wireless network of n nodes. Separate characterizations in term...
77
Voted
WIOPT
2010
IEEE
14 years 10 months ago
2010
IEEE
—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...
98
Voted
WG
1998
Springer
15 years 3 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
76
Voted
ACCV
2010
Springer
14 years 6 months ago
2010
Springer
The Viewing Graph [1] represents several views linked by the corresponding fundamental matrices, estimated pairwise. Given a Viewing Graph, the tuples of consistent camera matrices...