Pages that link to "Item:Q3758873"
From MaRDI portal
The following pages link to Doubly Lexical Orderings of Matrices (Q3758873):
Displaying 50 items.
- Solving the all-pairs-shortest-length problem on chordal bipartite graphs (Q294620) (← links)
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (Q412344) (← links)
- The Dilworth number of auto-chordal bipartite graphs (Q497341) (← links)
- Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs (Q497674) (← links)
- On orthogonal ray graphs (Q602682) (← links)
- Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph (Q672487) (← links)
- Monge and feasibility sequences in general flow problems (Q686244) (← links)
- Which claw-free graphs are perfectly orderable? (Q686245) (← links)
- Totally balanced dissimilarities (Q779024) (← links)
- Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs (Q864162) (← links)
- A linear-time algorithm for paired-domination problem in strongly chordal graphs (Q990092) (← links)
- On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs (Q995559) (← links)
- From a simple elimination ordering to a strong elimination ordering in linear time (Q1007631) (← links)
- \(k\)-tuple domination in graphs (Q1014390) (← links)
- Improved algorithms for the multicut and multiflow problems in rooted trees (Q1024699) (← links)
- Simplicial powers of graphs (Q1040586) (← links)
- A note on odd/even cycles (Q1120591) (← links)
- Recognizing single-peaked preferences on a tree (Q1122456) (← links)
- Even pairs in claw-free perfect graphs (Q1127877) (← links)
- A weighted min-max relation for intervals (Q1186133) (← links)
- The domatic number problem on some perfect graph families (Q1313715) (← links)
- Dominating cliques in chordal graphs (Q1322189) (← links)
- A general approach to avoiding two by two submatrices (Q1332690) (← links)
- Characterizations of two classes of digraphs (Q1336693) (← links)
- Unified all-pairs shortest path algorithms in the chordal hierarchy (Q1364781) (← links)
- Transversal partitioning in balanced hypergraphs (Q1372732) (← links)
- Meyniel weakly triangulated graphs. II: A theorem of Dirac (Q1377671) (← links)
- The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q1383368) (← links)
- Maximum vertex-weighted matching in strongly chordal graphs (Q1392564) (← links)
- A characterization of strongly chordal graphs (Q1584312) (← links)
- A new graph parameter to measure linearity (Q1708605) (← links)
- Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs (Q1735675) (← links)
- Complexity of distance paired-domination problem in graphs (Q1758170) (← links)
- Bichromatic \(P_{4}\)-composition schemes for perfect orderability (Q1827860) (← links)
- Permuting matrices to avoid forbidden submatrices (Q1894366) (← links)
- A note on perfectly orderable graphs (Q1917281) (← links)
- Largest \(j\)-simplices in \(d\)-cubes: Some relatives of the Hadamard maximum determinant problem (Q1923163) (← links)
- Incidence graphs of biacyclic hypergraphs (Q1923616) (← links)
- A good characterization of squares of strongly chordal split graphs (Q1944051) (← links)
- The multiple domination and limited packing problems in graphs (Q1944215) (← links)
- Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs (Q1962062) (← links)
- Bipartite completion of colored graphs avoiding chordless cycles of given lengths (Q2146743) (← links)
- Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation (Q2254614) (← links)
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds (Q2341752) (← links)
- Doubly lexical ordering of dense 0--1 matrices (Q2366069) (← links)
- An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs (Q2373437) (← links)
- Broadcast domination and multipacking in strongly chordal graphs (Q2414458) (← links)
- Balanced matrices (Q2433704) (← links)
- On opposition graphs, coalition graphs, and bipartite permutation graphs (Q2442203) (← links)
- Rainbow domination and related problems on strongly chordal graphs (Q2446318) (← links)
