Declawing a graph: polyhedra and branch-and-cut algorithms (Q2045043): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-021-00736-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3156386224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion} / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for cluster editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring Indifference: Unit Interval Vertex Deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof that `proper = unit' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for eliminating claws in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for finding longest cycles in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial kernelization for removing induced claws and diamonds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Listing All Maximal Cliques in Large Sparse Real-World Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs---a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval graphs and interval orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Kernel for Proper Interval Vertex Deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of induced graph matching on claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination When the Stars Are Out / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper interval vertex deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit interval vertex deletion: fewer vertices are relevant / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node-deletion problem for hereditary properties is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disconnected cuts in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal independent sets of vertices in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3942992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Four-Node Subgraphs in Triangle Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton cycles in claw-free graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 09:01, 26 July 2024

scientific article
Language Label Description Also known as
English
Declawing a graph: polyhedra and branch-and-cut algorithms
scientific article

    Statements

    Declawing a graph: polyhedra and branch-and-cut algorithms (English)
    0 references
    0 references
    0 references
    11 August 2021
    0 references
    graph declawing problem
    0 references
    claw-free graphs
    0 references
    branch-and-cut
    0 references
    polyhedral combinatorics
    0 references
    0 references
    0 references

    Identifiers