Bi-arc digraphs: recognition algorithm and applications
From MaRDI portal
Publication:6547945
DOI10.1007/978-3-031-55601-2_3MaRDI QIDQ6547945
Arash Rafiey, Akbar Rafiey, Pavol Hell
Publication date: 31 May 2024
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms
- On orthogonal ray graphs
- Existence theorems for weakly symmetric operations
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Algorithmic graph theory and perfect graphs
- Incidence matrices and interval graphs
- Linear programming, width-1 CSPs, and robust satisfaction
- Approximation of Minimum Cost Homomorphisms
- The LBFS Structure and Recognition of Interval Graphs
- Representation of a finite graph by a set of intervals on the real line
- Near-Unanimity Functions and Varieties of Reflexive Graphs
- Efficient Enumeration for Conjunctive Queries over X-underbar Structures
- Interval digraphs: An analogue of interval graphs
- Closure properties of constraints
- Bi‐arc graphs and the complexity of list homomorphisms
- Interval bigraphs and circular arc graphs
- Monotone Proper Interval Digraphs and Min-Max Orderings
- Asking the Metaquestions in Constraint Tractability
- Min-Orderable Digraphs
- Monotone monadic SNP and constraint satisfaction
- Graphs Admitting $k$-NU Operations. Part 1: The Reflexive Case
- On the complexity of CSP-based ideal membership problems
This page was built for publication: Bi-arc digraphs: recognition algorithm and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547945)
