Principles of artificial intelligence
Principles of artificial intelligence
A New Class Of Efficient Algorithms For Reconfiguration Of Memory Arrays
IEEE Transactions on Computers
Generation of Minimal Vertex Covers for Row/Column Allocation in Self-Repairable Arrays
IEEE Transactions on Computers
An improved fixed-parameter algorithm for vertex cover
Information Processing Letters
Checking that finite state concurrent programs satisfy their linear specification
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A general method to speed up fixed-parameter-tractable algorithms
Information Processing Letters
An efficient exact algorithm for constraint bipartite vertex cover
Journal of Algorithms
Vertex cover: further observations and further improvements
Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Solving large FPT problems on coarse-grained parallel machines
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Upper bounds for vertex cover further improved
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Crown reductions for the Minimum Weighted Vertex Cover problem
Discrete Applied Mathematics
Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Cardinality constrained and multicriteria (multi)cut problems
Journal of Discrete Algorithms
Vertex and edge covers with clustering properties: Complexity and algorithms
Journal of Discrete Algorithms
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
An exact algorithm based on chain implication for the Min-CVCB problem
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
On bounded block decomposition problems for under-specified systems of equations
Journal of Computer and System Sciences
Constraint bipartite vertex cover: simpler exact algorithms and implementations
Journal of Combinatorial Optimization
The parameterized complexity of enumerating frequent itemsets
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Hi-index | 0.00 |
Motivated by the research in reconfigurable memory array structures, this paper studies the complexity and algorithms for the constrained minimum vertex cover problem on bipartite graphs (NIN-CVCB) defined as follows: given a bipartite graph G = (V, E) with vertex bipartition V = U ∪ L and two integers ku and kl, decide whether there is a minimum vertex cover in G with at most ku vertices in U and at most kl vertices in L. It is proved in this paper that the MIN-CVCB problem is NP-complete. This answers a question posed by Hasan and Liu. A parameterized algorithm is developed for the problem, in which classical results in matching theory and recently developed techniques in parameterized computation theory are nicely combined and extended. The algorithm runs in time O(1.26ku + kl + (ku + kl) |G|) and significantly improves previous algorithms for the problem.