Pages that link to "Item:Q3747723"

The following pages link to The NP-completeness column: an ongoing guide (Q3747723):

Displaying 21 items.

• An explicit construction of optimal dominating and [1, 2]–dominating sets in grid (Q4956183) (← links)
• The NP-completeness column (Q4962719) (← links)
• The NP-completeness column (Q4962727) (← links)
• Deferred-query—An efficient approach for problems on interval and circular-arc graphs (Q5060115) (← links)
• Graph isomorphism is low for PP (Q5096798) (← links)
• (Q5743405) (← links)
• The NP-completeness column: An ongoing guide (Q5896449) (← links)
• The NP-completeness column: An ongoing guide (Q5903311) (← links)
• The NP-completeness column: An ongoing guide (Q5903516) (← links)
• The NP-completeness column: An ongoing guide (Q5903717) (← links)
• Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs (Q5941496) (← links)
• MaxCut on permutation graphs is NP‐complete (Q6047965) (← links)
• The overfull conjecture on split-comparability and split-interval graphs (Q6048434) (← links)
• Spined categories: generalizing tree-width beyond graphs (Q6056559) (← links)
• Maximum cut on interval graphs of interval count four is NP-complete (Q6124829) (← links)
• Further split graphs known to be class 1 and a characterization of subgraph-overfull split graphs (Q6145813) (← links)
• Complexity of maximum cut on interval graphs (Q6174803) (← links)
• Strong Cocomparability Graphs and Slash-Free Orderings of Matrices (Q6202755) (← links)
• The monadic second-order logic of graphs : Definable sets of finite graphs (Q6203539) (← links)
• Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs (Q6599055) (← links)
• Polyhedral approach to weighted connected matchings in general graphs (Q6633527) (← links)