Pages that link to "Item:Q3747723"
From MaRDI portal
The following pages link to The NP-completeness column: an ongoing guide (Q3747723):
Displayed 50 items.
- Hamiltonian cycles in linear-convex supergrid graphs (Q335338) (← links)
- Edge-colouring and total-colouring chordless graphs (Q389214) (← links)
- Subgraph isomorphism in graph classes (Q456655) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- The (weighted) metric dimension of graphs: hard and easy cases (Q494798) (← links)
- The Hamiltonian properties of supergrid graphs (Q497690) (← links)
- Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs (Q521809) (← links)
- Graph coloring with rejection (Q632809) (← links)
- Restrictions of graph partition problems. I (Q672380) (← links)
- On the equivalence covering number of splitgraphs (Q673014) (← links)
- Complete problems for monotone NP (Q673092) (← links)
- Monadic second-order evaluations on tree-decomposable graphs (Q685464) (← links)
- An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
- New heuristic approaches for maximum balanced biclique problem (Q781924) (← links)
- Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs (Q805638) (← links)
- Finding maximum cliques in arbitrary and in special graphs (Q807639) (← links)
- Recognizing and representing proper interval graphs in parallel using merging and sorting (Q869564) (← links)
- Clustering and outlier detection using isoperimetric number of trees (Q898224) (← links)
- A comparison of boundary graph grammars and context-free hypergraph grammars (Q918718) (← links)
- A simple algorithm to find Hamiltonian cycles in proper interval graphs (Q989586) (← links)
- The clique-separator graph for chordal graphs (Q1026133) (← links)
- Finding the minimum bandwidth of an interval graph (Q1090458) (← links)
- Bipartite permutation graphs (Q1092931) (← links)
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs (Q1099628) (← links)
- The complexity of optimization problems (Q1107309) (← links)
- Finding maximum cliques on circular-arc graphs (Q1108807) (← links)
- Trapezoid graphs and their coloring (Q1111577) (← links)
- Labeling algorithms for domination problems in sun-free chordal graphs (Q1117254) (← links)
- A decomposition strategy for the vertex cover problem (Q1123907) (← links)
- NP-completeness of edge-colouring some restricted graphs (Q1173977) (← links)
- Dominating sets in perfect graphs (Q1174132) (← links)
- Unit disk graphs (Q1174134) (← links)
- On minimum dominating sets with minimum intersection (Q1174139) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Edge colouring line graphs of unicyclic graphs (Q1186166) (← links)
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families (Q1186787) (← links)
- Problems with generalized Steiner problems (Q1186806) (← links)
- Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm (Q1198484) (← links)
- On a graph partition problem with application to VLSI layout (Q1199941) (← links)
- An efficient algorithm for finding a maximum weight 2-independent set on interval graphs (Q1199945) (← links)
- Hamiltonian cycle is polynomial on cocomparability graphs (Q1201106) (← links)
- The complexity of coloring games on perfect graphs (Q1202928) (← links)
- General vertex disjoint paths in series-parallel graphs (Q1208474) (← links)
- The complexity of domination problems in circle graphs (Q1209148) (← links)
- Efficient parallel recognition of some circular arc graphs. I (Q1209733) (← links)
- Graph isomorphism is low for PP (Q1210331) (← links)
- Complexity of path-forming games (Q1210546) (← links)
- Paths in interval graphs and circular arc graphs (Q1210553) (← links)
- A note on the Hamiltonian circuit problem on directed path graphs (Q1262132) (← links)
- Weighted connected domination and Steiner trees in distance-hereditary graphs (Q1270785) (← links)