Theoretical Computer Science

DOI10.1007/11560586MaRDI QIDQ5395087zbMATH OpenOpenAlexFDO

Authors Venkatesh Raman, Saket Saurabh, Somnath Sikdar

Publication date 1 November 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11560586

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Algorithm Engineering for Optimal Graph Bipartization
• Efficient exact algorithms through enumerating maximal independent sets and other techniques
• Experimental and Efficient Algorithms
• Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
• Algorithms and Data Structures

Cited in

(14)

• New bounds for the signless Laplacian spread
• Parameterized measure \& conquer for problems with no small kernels
• Exact exponential-time algorithms for finding bicliques
• Improved fixed parameter tractable algorithms for two ``edge problems: MAXCUT and MAXDAG
• Efficient exact algorithms through enumerating maximal independent sets and other techniques
• On polynomial kernels for structural parameterizations of odd cycle transversal
• Vertex Exponential Algorithms for Connected f-Factors
• Exact algorithms for the vertex separator problem in graphs
• Enumerate and measure: improving parameter budget management
• An exact exponential time algorithm for counting bipartite cliques
• Algorithms for #BIS-hard problems on expander graphs
• Approximating the exponential, the lanczos method and an Õ(m)-time spectral algorithm for balanced separator
• On the minimum feedback vertex set problem: Exact and enumeration algorithms
• Parameterized algorithms for d-hitting set: the weighted case

This page was built for publication: Theoretical Computer Science

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5395087)