1480 search results - page 14 / 296 » Distributed algorithms for weighted problems in sparse graph... |
DNA
2004
Springer
14 years 26 days ago
2004
Springer
Most DNA computing algorithms for mathematical problems start with combinatorial generation of an initial pool. Several methods for initialpool generation have been proposed, inclu...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
FAW
2009
Springer
14 years 2 months ago
2009
Springer
The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. We prove in this paper that the PATHWIDTH problem is NP-hard for parti...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Gaussian graphical models are of great interest in statistical learning. Because the conditional independencies between different nodes correspond to zero entries in the inverse c...
AI
2010
Springer
13 years 7 months ago
2010
Springer
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...