Pages that link to "Item:Q2366069"

The following pages link to Doubly lexical ordering of dense 0--1 matrices (Q2366069):

Displaying 50 items.

• An optimal algorithm to recognize Robinsonian dissimilarities (Q269174) (← links)
• An approximation algorithm for clustering graphs with dominating diametral path (Q290198) (← links)
• The recognition of geodetically connected graphs (Q293190) (← links)
• Solving the all-pairs-shortest-length problem on chordal bipartite graphs (Q294620) (← links)
• On recognition of threshold tolerance graphs and their complements (Q344853) (← links)
• Weighted maximum-clique transversal sets of graphs (Q410660) (← links)
• Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (Q412344) (← links)
• Arboricity, \(h\)-index, and dynamic algorithms (Q418737) (← links)
• The Dilworth number of auto-chordal bipartite graphs (Q497341) (← links)
• Strongly chordal and chordal bipartite graphs are sandwich monotone (Q652637) (← 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)
• Totally balanced dissimilarities (Q779024) (← links)
• Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs (Q864162) (← links)
• Variations of \(Y\)-dominating functions on graphs (Q941347) (← links)
• Signed and minus clique-transversal functions on graphs (Q976135) (← links)
• A linear-time algorithm for paired-domination problem in strongly chordal graphs (Q990092) (← links)
• On the complexity of signed and minus total domination in graphs (Q990954) (← 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)
• The domatic number problem on some perfect graph families (Q1313715) (← links)
• Unified all-pairs shortest path algorithms in the chordal hierarchy (Q1364781) (← links)
• The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q1383368) (← links)
• A new graph parameter to measure linearity (Q1708605) (← links)
• Complexity of distance paired-domination problem in graphs (Q1758170) (← links)
• Permuting matrices to avoid forbidden submatrices (Q1894366) (← links)
• Algorithmic aspects of the generalized clique-transversal problem on chordal graphs (Q1917287) (← links)
• Finding a sun in building-free graphs (Q1926049) (← links)
• Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs (Q1962062) (← 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)
• Possible numbers of \(x\)'s in an \(\{x, y\}\)-matrix with a given rank (Q2406574) (← links)
• Broadcast domination and multipacking in strongly chordal graphs (Q2414458) (← links)
• Variations of maximum-clique transversal sets on graphs (Q2430591) (← links)
• Rainbow domination and related problems on strongly chordal graphs (Q2446318) (← links)
• Additive sparse spanners for graphs with bounded length of largest induced cycle (Q2576868) (← links)
• Recognizing Threshold Tolerance Graphs in $$O(n^2)$$ Time (Q2945191) (← links)
• On the complexity of variations of mixed domination on graphs^† (Q2958268) (← links)
• Signed clique-transversal functions in graphs (Q3056375) (← links)
• The degree-preserving spanning tree problem in strongly chordal and directed path graphs (Q3057180) (← links)
• COMPLEXITY OF CERTAIN FUNCTIONAL VARIANTS OF TOTAL DOMINATION IN CHORDAL BIPARTITE GRAPHS (Q3166754) (← links)
• PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT (Q5248997) (← links)
• Totally Balanced Formal Context Representation (Q5255656) (← links)
• Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone (Q5323088) (← links)
• Recognition and drawing of stick graphs (Q5915944) (← links)
• A linear-time algorithm for semitotal domination in strongly chordal graphs (Q6110593) (← links)
• The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q6184359) (← links)
• Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs (Q6487434) (← links)
• Uniformly monotone partitioning of polygons (Q6593668) (← links)