scientific article; zbMATH DE number 3908482
From MaRDI portal
Publication:3686754
Recommendations
- Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs
- Cycle-free partial orders and chordal comparability graphs
- scientific article; zbMATH DE number 3888924
- On some algorithms and properties of comparability graphs
- On Comparability and Permutation Graphs
Cited in
(74)- Succinct permutation graphs
- Introduction à l'algorithmique des objets partagés
- Nesting of prime substructures in \(k-\)ary relations
- Comparability digraphs: an analogue of comparability graphs
- Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs
- Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs
- Gallai-like characterization of strong cocomparability graphs
- scientific article; zbMATH DE number 1151797 (Why is no real title available?)
- Modular decomposition of hypergraphs
- A simple linear time algorithm to solve the MIST problem on interval graphs
- Recognizing \(k\)-clique extendible orderings
- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- Achromatic number is NP-complete for cographs and interval graphs
- Schedule-induced posets
- On semi-\(P_ 4\)-sparse graphs
- Unit disk graphs
- \(P_ 4\)-trees and substitution decomposition
- A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
- scientific article; zbMATH DE number 3965452 (Why is no real title available?)
- A computational complexity comparative study of graph tessellation problems
- An algorithm for solving the jump number problem
- Tree-width and path-width of comparability graphs of interval orders
- Topological adjacency relations on \(Z^{n}\)
- A new LBFS-based algorithm for cocomparability graph recognition
- scientific article; zbMATH DE number 3888924 (Why is no real title available?)
- A \(k\)-structure generalization of the theory of 2-structures
- Extending partial suborders
- A tight lower bound for primitivity in k-structures
- A polynomial algorithm for recognizing the \(\mathcal A\)-order class
- Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph
- Aggregation of monotone reciprocal relations with application to group decision making
- Satisfiability problems on intervals and unit intervals
- Graphs and topologies on discrete sets
- Neighborhood classes of \(H\)-comparability graphs
- Greedy posets for the bump-minimizing problem
- The mutual exclusion scheduling problem for permutation and comparability graphs.
- On the power of graph searching for cocomparability graphs
- On the closure of graphs under substitution
- The order-interval hypergraph of a finite poset and the König property
- Preemptive hybrid flowshop scheduling problem of interval orders
- Peakless functions on graphs
- Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs
- On some complexity properties of N-free posets and posets with bounded decomposition diameter
- Comparability graphs with constraint, partial semi-orders and interval orders
- Scattering number and modular decomposition
- Bipartite bithreshold graphs
- The smallest graphs with niche number three
- Parameterized algorithms for the independent set problem in some hereditary graph classes
- Triangulating graphs with few \(P_4\)'s
- On some algorithms and properties of comparability graphs
- Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number
- On transitive orientations with restricted covering graphs
- Algorithms and Computation
- How to use the minimal separators of a graph for its chordal triangulation
- Independent domination in finitely defined classes of graphs: polynomial algorithms
- Fully dynamic representations of interval graphs
- The simultaneous representation problem for chordal, comparability and permutation graphs
- Graph-Theoretic Concepts in Computer Science
- The number of nonisomorphic posets having 12 elements
- A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs
- On the pathwidth of chordal graphs
- On the generation of circuits and minimal forbidden sets
- On the complexity of dynamic programming for sequencing problems with precedence constraints
- Weak order polytopes.
- Finding the minimum bandwidth of an interval graph
- Modular decomposition and transitive orientation
- The longest cycle problem is polynomial on interval graphs
- On probe permutation graphs
- Optimal pricing of capacitated networks
- On finding the jump number of a partial order by substitution decomposition
- Another note on Dilworth's decomposition theorem.
- Algorithmic characterizations of interval orderd hypergraphs and applications
- Scheduling of project networks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3686754)
