Doubly Lexical Orderings of Matrices
From MaRDI portal
Publication:3758873
DOI10.1137/0216057zbMATH Open0622.05045OpenAlexW1968148694MaRDI QIDQ3758873FDOQ3758873
Publication date: 1987
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0216057
Recommendations
chordal graphstotally balanced matriceslexical orderingacyclic hypergraphsacyclic data basesDoubly lexical orderingssubtree matrices
Cited In (79)
- Dominating cliques in chordal graphs
- Monge and feasibility sequences in general flow problems
- Even pairs in claw-free perfect graphs
- A linear-time algorithm for paired-domination problem in strongly chordal graphs
- Perfect circular arc coloring
- Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph
- Title not available (Why is that?)
- Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs
- On opposition graphs, coalition graphs, and bipartite permutation graphs
- Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs
- Title not available (Why is that?)
- The domatic number problem on some perfect graph families
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
- Simplicial powers of graphs
- Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs
- A note on perfectly orderable graphs
- Incidence graphs of biacyclic hypergraphs
- A characterization of strongly chordal graphs
- On orthogonal ray graphs
- Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs
- Solving the all-pairs-shortest-length problem on chordal bipartite graphs
- A note on odd/even cycles
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
- Complexity of distance paired-domination problem in graphs
- From a simple elimination ordering to a strong elimination ordering in linear time
- A good characterization of squares of strongly chordal split graphs
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- \(k\)-tuple domination in graphs
- Largest \(j\)-simplices in \(d\)-cubes: Some relatives of the Hadamard maximum determinant problem
- Dually chordal graphs
- Title not available (Why is that?)
- Balanced matrices
- On minimally non-firm binary matrices
- Generating effective symmetry-breaking predicates for search problems
- Meyniel weakly triangulated graphs. II: A theorem of Dirac
- Maximum vertex-weighted matching in strongly chordal graphs
- Improved algorithms for the multicut and multiflow problems in rooted trees
- Doubly lexical ordering of dense 0--1 matrices
- Characterizations of two classes of digraphs
- A general approach to avoiding two by two submatrices
- Recognizing single-peaked preferences on a tree
- An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs
- Totally balanced dissimilarities
- Simplicial Powers of Graphs
- A linear-time algorithm for semitotal domination in strongly chordal graphs
- Which claw-free graphs are perfectly orderable?
- Broadcast Domination in Graphs
- Standard graded vertex cover algebras, cycles and leaves
- The Dilworth number of auto-chordal bipartite graphs
- A linear‐time algorithm for broadcast domination in a tree
- A weighted min-max relation for intervals
- On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs
- The multiple domination and limited packing problems in graphs
- Additive sparse spanners for graphs with bounded length of largest induced cycle
- Bichromatic \(P_{4}\)-composition schemes for perfect orderability
- Rainbow domination and related problems on strongly chordal graphs
- Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs
- A new graph parameter to measure linearity
- Transversal partitioning in balanced hypergraphs
- Unified all-pairs shortest path algorithms in the chordal hierarchy
- Permuting matrices to avoid forbidden submatrices
- Broadcast domination and multipacking in strongly chordal graphs
- Recognition and drawing of stick graphs
- Hardness and structural results for half-squares of restricted tree convex bipartite graphs
- Graph classes and the switch Markov chain for matchings
- The parallel complexity of elimination ordering procedures
- Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation
- Gallai-like characterization of strong cocomparability graphs
- Bipartite completion of colored graphs avoiding chordless cycles of given lengths
- Bipartite Analogues of Comparability and Cocomparability Graphs
- Double occurrence words: their graphs and matrices
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- Broadcast domination and multipacking: bounds and the integrality gap
- Quasimonotone graphs
- The matrix taxonomy of finitely complete categories
- Strong Cocomparability Graphs and Slash-Free Orderings of Matrices
- Large Homogeneous Submatrices
- Min-Orderable Digraphs
- Strong Chordality of Graphs with Possible Loops
This page was built for publication: Doubly Lexical Orderings of Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3758873)
