Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2008.04.003 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2008.04.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005349020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chordal proper circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Characterizations of Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Ferrers dimension of a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation result for a periodic allocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716684 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time recognition of unit circular-arc graphs / 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: Algorithms for finding clique-transversals of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List homomorphisms and circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Comparability Graphs and of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4201932 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two remarks on circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval bigraphs and circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: $O(M\cdot N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Test for the Consecutive Ones Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: PC trees and circular-ones arrangements. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of local tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time recognition of Helly circular-arc models and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simpler Linear-Time Recognition of Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques of Helly Circular-arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper Helly Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient construction of unit circular-arc models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit Circular-Arc Graph Representations and Feasible Circulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5618407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of Circle Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the 2-Chain Subgraph Cover and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular decomposition and transitive orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Intersection Graph Theory / 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: Q3686754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing interval digraphs and interval bigraphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5804173 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3898496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval digraphs: An analogue of interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular‐arc digraphs: A characterization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing digraphs using intervals or circular arcs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular-arc graphs with clique cover number two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient graph representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization problems for graphs, partially ordered sets, lattices, and families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix characterizations of circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structure theorem for the consecutive 1's property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure theorems for some circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4173373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Test for Circular-Arc Graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2008.04.003 / rank
 
Normal rank

Latest revision as of 14:39, 10 December 2024

scientific article
Language Label Description Also known as
English
Characterizations and recognition of circular-arc graphs and subclasses: a survey
scientific article

    Statements

    Characterizations and recognition of circular-arc graphs and subclasses: a survey (English)
    0 references
    0 references
    0 references
    15 December 2009
    0 references
    algorithms
    0 references
    circular-arc graphs
    0 references
    co-bipartite circular-arc graphs
    0 references
    Helly circular-arc graphs
    0 references
    proper circular-arc graphs
    0 references
    unit circular-arc graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references