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

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.endm.2008.01.020 / rank
Normal rank
 
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.endm.2008.01.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965463345 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1016/J.ENDM.2008.01.020 / rank
 
Normal rank

Latest revision as of 09:26, 21 December 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