129 search results - page 8 / 26 » The Parameterized Complexity of the Minimum Shared Edges Pro... |
NETWORKS
2010
14 years 7 months ago
2010
We provide first-time fixed-parameter tractability results for the NP-complete problems Maximum Full-Degree Spanning Tree and Minimum-Vertex Feedback Edge Set. These problems are...
COCOON
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We study the maximum flow problem in an undirected planar network with both edge and vertex capacities (EVC-network). A previous study reduces the minimum cut problem in ...
JCO
2006
14 years 9 months ago
2006
Abstract. We study efficient algorithms for establishing reliable connections with bandwidth guarantees in communication networks. In the normal mode of operation, each connection ...
85
Voted
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
87
Voted
TCS
2010
14 years 7 months ago
2010
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...