HIGHLIGHTS
- who: Alan Arroyo from the (UNIVERSITY) have published the research: Inserting One Edge into a Simple Drawing is Hard, in the Journal: (JOURNAL)
- what: In contrast the authors show that it NP-complete to decide whether can be inserted This remains true even if the authors assume that the pseudocircular that the edges can be extended to an arrangement of pseudocircles. The authors show that this decision problem is NP-complete, even if G is a matching plus two isolated vertices which are the endpoints of e. Refining the hardness proof, the authors show that . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.