Algorithms for clique-independent sets on subclasses of circular-arc graphs (Q2500526): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Jayme Luiz Szwarcfiter / rank
Normal rank
 
Property / author
 
Property / author: Jayme Luiz Szwarcfiter / 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.dam.2006.03.022 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2097999883 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-clique Helly circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On balanced graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Neighborhood Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum \(h\)-colourable subgraph problem in balanced graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibres and ordered set coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On clique-transversals and clique-independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability in circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects of clique-transversal and clique-independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms on circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time recognition of circular-arc 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: Characterizing circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Test for Circular-Arc Graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:21, 24 June 2024

scientific article
Language Label Description Also known as
English
Algorithms for clique-independent sets on subclasses of circular-arc graphs
scientific article

    Statements

    Identifiers