7 citations · 11 across the 6 of their papers we have counts for
3 papers · 1 filter
Exploiting Reduction Rules and Data Structures: Local Search for Minimum Vertex Cover in Massive Graphs
Yi Fan, Chengqian Li, Zongjie Ma +3
The Minimum Vertex Cover (MinVC) problem is a well-known NP-hard problem. Recently there has been great interest in solving this problem on real-world massive graphs. For such grap…
Linear-Time Superbubble Identification Algorithm for Genome Assembly
Ljiljana Brankovic, Costas S. Iliopoulos, Ritu Kundu +3
DNA sequencing is the process of determining the exact order of the nucleotide bases of an individual's genome in order to catalogue sequence variation and understand its biologica…
Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles
Ljiljana Brankovic, Henning Fernau, Joachim Kneis +1
The lower and the upper irredundance numbers of a graph , denoted and respectively, are conceptually linked to domination and independence numbers and have numer…