scientific article; zbMATH DE number 3908482
From MaRDI portal
Publication:3686754
zbMATH Open0569.05046MaRDI QIDQ3686754FDOQ3686754
Authors: Rolf H. Möhring 
Publication date: 1985
Title of this publication is not available (Why is that?)
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
interval graphspartial orderscombinatorial optimization problemsinterval ordersincomparability graphsorder dimensionjump numberComparability graphscoefficient algorithmscomparability graph recognitiondecomposing comparability graphsinterval graph recognition
Partial orders, general (06A06) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75)
Cited In (74)
- Introduction à l'algorithmique des objets partagés
- Title not available (Why is that?)
- 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
- Comparability digraphs: an analogue of comparability graphs
- Recognizing \(k\)-clique extendible orderings
- A simple linear time algorithm to solve the MIST problem on interval graphs
- Succinct permutation graphs
- Nesting of prime substructures in \(k-\)ary relations
- Modular decomposition of hypergraphs
- A computational complexity comparative study of graph tessellation problems
- Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number
- How to use the minimal separators of a graph for its chordal triangulation
- The number of nonisomorphic posets having 12 elements
- A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs
- Satisfiability problems on intervals and unit intervals
- On transitive orientations with restricted covering graphs
- The longest cycle problem is polynomial on interval graphs
- On probe permutation graphs
- An algorithm for solving the jump number problem
- Aggregation of monotone reciprocal relations with application to group decision making
- The order-interval hypergraph of a finite poset and the König property
- Achromatic number is NP-complete for cographs and interval graphs
- On the power of graph searching for cocomparability graphs
- Unit disk graphs
- Title not available (Why is that?)
- Modular decomposition and transitive orientation
- A tight lower bound for primitivity in k-structures
- Neighborhood classes of \(H\)-comparability graphs
- On the generation of circuits and minimal forbidden sets
- Topological adjacency relations on \(Z^{n}\)
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
- Extending partial suborders
- Comparability graphs with constraint, partial semi-orders and interval orders
- On the complexity of dynamic programming for sequencing problems with precedence constraints
- Independent domination in finitely defined classes of graphs: polynomial algorithms
- Finding the minimum bandwidth of an interval graph
- \(P_ 4\)-trees and substitution decomposition
- On the pathwidth of chordal graphs
- On finding the jump number of a partial order by substitution decomposition
- The mutual exclusion scheduling problem for permutation and comparability graphs.
- Weak order polytopes.
- Scheduling of project networks
- Tree-width and path-width of comparability graphs of interval orders
- Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs
- Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph
- Graph-Theoretic Concepts in Computer Science
- A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs
- A new LBFS-based algorithm for cocomparability graph recognition
- A \(k\)-structure generalization of the theory of 2-structures
- On some algorithms and properties of comparability graphs
- Parameterized algorithms for the independent set problem in some hereditary graph classes
- Algorithms and Computation
- The simultaneous representation problem for chordal, comparability and permutation graphs
- A polynomial algorithm for recognizing the \(\mathcal A\)-order class
- Greedy posets for the bump-minimizing problem
- On the closure of graphs under substitution
- Another note on Dilworth's decomposition theorem.
- On semi-\(P_ 4\)-sparse graphs
- Graphs and topologies on discrete sets
- The smallest graphs with niche number three
- Optimal pricing of capacitated networks
- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- Scattering number and modular decomposition
- Algorithmic characterizations of interval orderd hypergraphs and applications
- Triangulating graphs with few \(P_4\)'s
- Title not available (Why is that?)
- Fully dynamic representations of interval graphs
- Preemptive hybrid flowshop scheduling problem of interval orders
- On some complexity properties of N-free posets and posets with bounded decomposition diameter
- Schedule-induced posets
- Peakless functions on graphs
- Bipartite bithreshold graphs
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)
