871 search results - page 125 / 175 » The vertex-cover polynomial of a graph |
205
click to vote
RECOMB
2004
Springer
16 years 7 months ago
2004
Springer
Nuclear magnetic resonance (NMR) spectroscopy allows scientists to study protein structure, dynamics and interactions in solution. A necessary first step for such applications is ...
206
click to vote
STACS
2007
Springer
16 years 28 days ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
193
click to vote
COMPGEOM
2003
ACM
16 years 2 days ago
2003
ACM
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
169
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
196
click to vote
FSTTCS
2009
Springer
15 years 11 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...