On cliques of Helly Circular-arc Graphs (Q3503539): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Clique Graph Recognition Is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for clique-independent sets on subclasses of circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial characterization of clique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations and recognition of circular-arc graphs and subclasses: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper Helly Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of clique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient graph representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4407448 / rank
 
Normal rank

Revision as of 10:22, 28 June 2024

scientific article
Language Label Description Also known as
English
On cliques of Helly Circular-arc Graphs
scientific article

    Statements

    On cliques of Helly Circular-arc Graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 June 2008
    0 references
    algorithms
    0 references
    Helly circular-arc graphs
    0 references
    proper Helly circular-arc graphs
    0 references
    clique graphs
    0 references
    maximum weight cliques
    0 references

    Identifiers