### Table 1: Operators in the proof of NP-completeness

1992

Cited by 14

### Table 1: Operators in the proof of NP-completeness

1992

Cited by 14

### Table 2: Review of NP-completeness results for graph layout problems.

2002

"... In PAGE 6: ... It is possible to show that many layout problems remain NP-complete even for cer- tain restricted classes of graphs. Table2 summarizes these known negative results and also includes references for the proofs of Theorem 1. Fixed parameter results.... ..."

Cited by 11

### Table 1. Summary of results. NPCmeans that the problem is NP-complete.

1997

"... In PAGE 3: ... Since we can prove that it is NP-complete to decide whether a 2-connected planar graph of maximum degree 2 T ? 1 has a T -spanning tree, this result establishes a complete characterization of the T -spanning tree problem for k-connected planar graphs of maximum degree G. Table1 summarizes the results (it assumes that G gt; T 2). Organization of the paper Section 2 provides basic terminology.... ..."

Cited by 5

### Table 1. Summary of results. NPCmeans that the problem is NP-complete.

1997

"... In PAGE 3: ... Since we can prove that it is NP-complete to decide whether a 2-connected planar graph of maximum degree 2 T ? 1 has a T -spanning tree, this result establishes a complete characterization of the T -spanning tree problem for k-connected planar graphs of maximum degree G. Table1 summarizes the results (it assumes that G gt; T 2). Organization of the paper Section 2 provides basic terminology.... ..."

Cited by 5

### Table 1. Summary of results. NPCmeans that the problem is NP-complete.

1997

"... In PAGE 3: ... Since we can prove that it is NP-complete to decide whether a 2-connected planar graph of maximum degree 2 T ? 1 has a T -spanning tree, this result establishes a complete characterization of the T -spanning tree problem for k-connected planar graphs of maximum degree G. Table1 summarizes the results (it assumes that G gt; T 2). Organization of the paper Section 2 provides basic terminology.... ..."

Cited by 5

### Table 2: Complexity of AHNEPs solving NP-complete problems

### Table 2: Possible Multiobjective NP-Complete Functions NP-Complete Problem Examples

"... In PAGE 4: ... This may prevent general comparison between various MOEAs, but the problems apos; inherent di culty should present the desired algorithmic challenges and complement numeric test suite MOPs. Table2 suggests possible NP- Complete MOPs for inclusion. To date, only two non-nu- merical MOP examples are found in the MOEA literature: one is a multiobjective NP-Complete example (a multiob- 0 0.... ..."