Innovative computational methods for transcriptomic data analysis
Proceedings of the 2006 ACM symposium on Applied computing
Crown reductions for the Minimum Weighted Vertex Cover problem
Discrete Applied Mathematics
A new approach and faster exact methods for the maximum common subgraph problem
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
| Hi-index | 0.00 |
Summary form only given. Two kernelization methods for the vertex cover problem are investigated. The first, LP-kernelization has been in prior use and is known to produce predictable results. The second, crown reduction, is newer and faster but generates more variable results. Previously-unknown connections between these powerful methods are established. It is also shown that the problem of finding an induced crown-free subgraph in an arbitrary graph is decidable in polynomial time. Applications of crown structures are discussed.