4865 search results - page 315 / 973 » The Complexity of Graph Connectivity |
150
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The disjoint paths problem asks, given an graph G and k + 1 pairs of terminals (s0, t0), . . . , (sk, tk), whether there are k + 1 pairwise disjoint paths P0, . . . , Pk, such tha...
171
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
Abstract. Let G denote a directed graph with adjacency matrix Q and indegree matrix D. We consider the Kirchhoff matrix L = D - Q, sometimes referred to as the directed Laplacian. ...
171
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
A set M of edges of a graph G is a matching if no two edges in M are incident to the same vertex. The matching number of G is the maximum cardinality of a matching of G. A set S o...
189
click to vote
JCO
2007
15 years 6 months ago
2007
The problem of radio channel assignments with multiple levels of interference can be modelled using graph theory. The theory of integer vertex-labellings of graphs with distance c...
186
click to vote
IFIP12
2009
15 years 4 months ago
2009
In this paper we propose a web search methodology based on the Ant Colony Optimization (ACO) algorithm, which aims to enhance the amount of the relevant information in respect to a...