171 search results - page 20 / 35 » Algorithms for Single-Source Vertex Connectivity |
RECOMB
2005
Springer
15 years 9 months ago
2005
Springer
: A series of genome-scale algorithms and high-performance implementations is described and shown to be useful in the genetic analysis of gene transcription. With them it is possib...
101
click to vote
MFCS
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
126
click to vote
SIROCCO
1997
14 years 11 months ago
1997
A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the netw...
PAMI
2007
14 years 9 months ago
2007
—A new parameter-free graph-morphology-based segmentation algorithm is proposed to address the problem of partitioning a 3D triangular mesh into disjoint submeshes that correspon...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...