Doubly lexical ordering of dense 0--1 matrices
From MaRDI portal
(Redirected from Publication:2366069)
Recommendations
Cites work
- scientific article; zbMATH DE number 432839 (Why is no real title available?)
- scientific article; zbMATH DE number 437537 (Why is no real title available?)
- Characterizations of strongly chordal graphs
- Characterizations of totally balanced matrices
- Degrees of acyclicity for hypergraphs and relational database schemes
- Doubly Lexical Orderings of Matrices
- Three Partition Refinement Algorithms
- Totally-Balanced and Greedy Matrices
Cited in
(53)- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- Uniformly monotone partitioning of polygons
- From a simple elimination ordering to a strong elimination ordering in linear time
- Doubly-lexical order supports standardisation and recursive partitioning of formal context
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
- Finding a sun in building-free graphs
- Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs
- Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs
- The degree-preserving spanning tree problem in strongly chordal and directed path graphs
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
- Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone
- Recognizing threshold tolerance graphs in \(O(n^2)\) time
- On recognition of threshold tolerance graphs and their complements
- Totally balanced dissimilarities
- Improved algorithms for the multicut and multiflow problems in rooted trees
- Unified all-pairs shortest path algorithms in the chordal hierarchy
- Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs
- Broadcast domination and multipacking in strongly chordal graphs
- Possible numbers of \(x\)'s in an \(\{x, y\}\)-matrix with a given rank
- The parallel complexity of elimination ordering procedures
- Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph
- Weighted maximum-clique transversal sets of graphs
- Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation
- Permuting matrices to avoid forbidden submatrices
- Signed and minus clique-transversal functions on graphs
- Arboricity, \(h\)-index, and dynamic algorithms
- Variations of \(Y\)-dominating functions on graphs
- Monge and feasibility sequences in general flow problems
- A linear-time algorithm for semitotal domination in strongly chordal graphs
- Strongly chordal and chordal bipartite graphs are sandwich monotone
- Complexity of certain functional variants of total domination in chordal bipartite graphs
- Additive sparse spanners for graphs with bounded length of largest induced cycle
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- Variations of maximum-clique transversal sets on graphs
- scientific article; zbMATH DE number 1063943 (Why is no real title available?)
- Doubly Lexical Orderings of Matrices
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
- \(k\)-tuple domination in graphs
- The Dilworth number of auto-chordal bipartite graphs
- Partition refinement techniques: an interesting algorithmic tool kit
- Totally Balanced Formal Context Representation
- Signed clique-transversal functions in graphs
- Rainbow domination and related problems on strongly chordal graphs
- scientific article; zbMATH DE number 2188356 (Why is no real title available?)
- A linear-time algorithm for paired-domination problem in strongly chordal graphs
- The recognition of geodetically connected graphs
- Solving the all-pairs-shortest-length problem on chordal bipartite graphs
- The domatic number problem on some perfect graph families
- An approximation algorithm for clustering graphs with dominating diametral path
- On the complexity of signed and minus total domination in graphs
- An optimal algorithm to recognize Robinsonian dissimilarities
- On the complexity of variations of mixed domination on graphs
- Complexity of distance paired-domination problem in graphs
This page was built for publication: Doubly lexical ordering of dense 0--1 matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2366069)
