4865 search results - page 4 / 973 » The Complexity of Graph Connectivity |
112
Voted
EOR
2008
15 years 1 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
107
click to vote
EDBT
2004
ACM
16 years 1 months ago
2004
ACM
In this paper we present HOPI, a new connection index for XML documents based on the concept of the 2?hop cover of a directed graph introduced by Cohen et al. In contrast to most o...
127
click to vote
ALENEX
2003
15 years 3 months ago
2003
Graph models for real-world complex networks such as the Internet, the WWW and biological networks are necessary for analytic and simulation-based studies of network protocols, al...
126
Voted
ESA
2006
Springer
15 years 5 months ago
2006
Springer
We show that enumerating all minimal spanning and connected subsets of a given matroid is quasi-polynomially equivalent to the well-known hypergraph transversal problem, and thus ...
105
Voted
AAAI
2008
15 years 4 months ago
2008
Complex graphs, in which multi-type nodes are linked to each other, frequently arise in many important applications, such as Web mining, information retrieval, bioinformatics, and...