1729 search results - page 4 / 346 » Bound Graph Polysemy |
159
Voted
ESA
2008
Springer
15 years 7 months ago
2008
Springer
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
132
click to vote
COMBINATORICA
1999
15 years 5 months ago
1999
We present a sublinear-time algorithm for testing whether a bounded degree graph is bipartite or far from being bipartite. Graphs are represented by incidence lists of bounded len...
165
click to vote
WG
2005
Springer
15 years 11 months ago
2005
Springer
The Tutte polynomial is a notoriously hard graph invariant, and efficient algorithms for it are known only for a few special graph classes, like for those of bounded tree-width. Th...
160
click to vote
ECCC
2000
15 years 5 months ago
2000
We consider testing graph expansion in the bounded-degree graph model. Specifically, we refer to algorithms for testing whether the graph has a second eigenvalue bounded above by a...
164
click to vote
STACS
2009
Springer
16 years 17 days ago
2009
Springer
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...