2304 search results - page 104 / 461 » On the Vulnerability of Large Graphs |
135
click to vote
JCT
2007
15 years 6 months ago
2007
Abstract. We prove that a binary matroid with huge branchwidth contains the cycle matroid of a large grid as a minor. This implies that an infinite antichain of binary matroids ca...
193
click to vote
AVI
2006
15 years 7 months ago
2006
Scientific measurements are often depicted as line graphs. Stateof-the-art high throughput systems in life sciences, telemetry and electronics measurement rapidly generate hundred...
144
click to vote
ICALP
2003
Springer
15 years 11 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
172
Voted
SIAMCOMP
2010
15 years 4 months ago
2010
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
165
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching h...