4865 search results - page 236 / 973 » The Complexity of Graph Connectivity |
146
click to vote
NETWORKS
2008
15 years 5 months ago
2008
We present a new efficient approach for solving the multicommodity flow problem as a sequence of subproblems, each on a very sparse but connected network. We show that each subpro...
139
click to vote
DAM
2002
15 years 4 months ago
2002
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
133
Voted
SPAA
2010
ACM
15 years 3 months ago
2010
ACM
We describe parallel implementations of LU factorization with pivoting for multicore architectures. Implementations that differ in two different dimensions are discussed: (1) usin...
141
Voted
ENDM
2010
15 years 2 months ago
2010
In this paper we consider the structural analysis problem for differential-algebraic systems with conditional equations. This consists, given a conditional differential algebraic ...
127
click to vote
COCOA
2007
Springer
15 years 11 months ago
2007
Springer
We consider the problem of connecting given vertex pairs over a stochastic metric graph, each vertex of which has a probability of presence independently of all other ver