Total Ordering Problem
From MaRDI portal
Publication:4178507
DOI10.1137/0208008zbMATH Open0395.68065OpenAlexW1964678328WikidataQ56486198 ScholiaQ56486198MaRDI QIDQ4178507FDOQ4178507
Authors:
Publication date: 1979
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0208008
Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Applications of graph theory to circuits and networks (94C15) Total orders (06A05) Applications of design theory to circuits and networks (94C30)
Cited In (56)
- Streaming approximation resistance of every ordering CSP
- Parameterized complexity of simultaneous planarity
- Complexity classification transfer for CSPs via algebraic products
- Decision problems for subregular classes
- Partial and simultaneous transitive orientations via modular decompositions
- Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables
- Upward Book Embeddings of st-Graphs
- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey
- A geometric approach to betweenness
- Anonymous monotonic social welfare functions
- Strict betweennesses induced by posets as well as by graphs
- Algorithms and complexity of sandwich problems in graphs (extended abstract)
- Upward Partitioned Book Embeddings
- Permutation reconstruction from MinMax-betweenness constraints
- On the Generalised Character Compatibility Problem for Non-branching Character Trees
- Acyclicity in edge-colored graphs
- A mixed integer linear programming formulation of the maximum betweenness problem
- Approximation schemes for the betweenness problem in tournaments and related ranking problems
- On the complexity of computing treebreadth
- Computing NodeTrix Representations of Clustered Graphs
- On Reichenbach's causal betweenness
- The complexity of shelflisting
- Bounded Embeddings of Graphs in the Plane
- On the complexity of recognizing Wheeler graphs
- Condorcet domains satisfying Arrow's single-peakedness
- Good orientations of unions of edge‐disjoint spanning trees
- Path-based supports for hypergraphs
- Betweenness parameterized above tight lower bound
- Upward book embeddability of \(st\)-graphs: complexity and algorithms
- On the computational complexity of ordered subgraph recognition
- Title not available (Why is that?)
- On the Hardness and Inapproximability of Recognizing Wheeler Graphs
- StreamTable: an area proportional visualization for tables with flowing streams
- Beyond Level Planarity
- Common intervals and permutation reconstruction from \textit{MinMax}-betweenness constraints
- Expansion of gene clusters, circular orders, and the shortest Hamiltonian path problem
- On random betweenness constraints
- Beyond level planarity: cyclic, torus, and simultaneous level planarity
- Title not available (Why is that?)
- Recognizing \(k\)-clique extendible orderings
- Topological Birkhoff
- Characterization and representation problems for intersection betweennesses
- Hardness of fully dense problems
- Inapproximability for metric embeddings into $\mathbb{R}^{d}$
- The importance of being proper
- On subbetweennesses of trees: hardness, algorithms, and characterizations
- On Random Ordering Constraints
- Title not available (Why is that?)
- Simultaneous Embedding
- Title not available (Why is that?)
- Simple linear time approximation algorithm for betweenness
- Sequence Covering Arrays and Linear Extensions
- Advancements on SEFE and partitioned book embedding problems
- Crossing-constrained hierarchical drawings
- On recognizing staircase compatibility
- Permuting matrices to avoid forbidden submatrices
This page was built for publication: Total Ordering Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4178507)
