871 search results - page 47 / 175 » The vertex-cover polynomial of a graph |
ALT
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts
WG
2007
Springer
15 years 3 months ago
2007
Springer
The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. Although pathwidth is a well-known and well-studied graph parameter, t...
112
click to vote
COLOGNETWENTE
2010
14 years 8 months ago
2010
Bisimplicial edges in bipartite graphs are closely related to pivots in Gaussian elimination that avoid turning zeroes into non-zeroes. We present a new deterministic algorithm to...
89
Voted
DATE
2007
IEEE
15 years 4 months ago
2007
IEEE
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time ...
84
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Chec...