Counting the number of vertex covers in a trapezoid graph (Q990956): 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: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2009.08.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2076516201 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chaining algorithms for multiple genome comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3797233 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the size of minimal covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapezoid graphs and their coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal sequential and parallel algorithms to compute all cut vertices on trapezoid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and simple algorithms to count the number of vertex covers in an interval graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for counting the number of minimal vertex covers with minimum/maximum size in an interval graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On efficient fixed-parameter algorithms for weighted vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting the number of independent sets in chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for the minimum connected domination on trapezoid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:17, 3 July 2024

scientific article
Language Label Description Also known as
English
Counting the number of vertex covers in a trapezoid graph
scientific article

    Statements

    Counting the number of vertex covers in a trapezoid graph (English)
    0 references
    0 references
    0 references
    1 September 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    trapezoid graph
    0 references
    vertex cover
    0 references
    combinatorial problems
    0 references
    counting problems
    0 references
    0 references