Pith. sign in

Information Processing Letters 110(12-13), 521–523 (2010)

Bagheri, A · 2010 · DOI 10.1016/j.ipl.2010.04.019

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
open at publisher browse 1 citing papers

fields

cs.CG 1

years

2019 1

verdicts

CONDITIONAL 1

representative citing papers

Extending Simple Drawings

cs.CG · 2019-08-21 · conditional · novelty 7.0

Inserting a prescribed set of edges into a simple drawing is NP-complete, the maximization version is APX-hard, and one-edge insertion is polynomial when the endpoints form a dominating set.

citing papers explorer

Showing 1 of 1 citing paper.

  • Extending Simple Drawings cs.CG · 2019-08-21 · conditional · none · ref 3

    Inserting a prescribed set of edges into a simple drawing is NP-complete, the maximization version is APX-hard, and one-edge insertion is polynomial when the endpoints form a dominating set.