Loading...
Loading...

Go to the content (press return)

One side crossing minimization is NP-hard for sparse graphs

Author
Muñoz, X.; Unger, W.; Vrto, I.
Type of activity
Journal article
Journal
Lecture notes in computer science
Date of publication
2001-12
Volume
2265
First page
115
Last page
123
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants