Loading...
Loading...

Go to the content (press return)

One sided crossing minimization is NP-Hard for sparse graphs

Author
Muñoz, X.
Type of activity
Presentation of work at congresses
Name of edition
9th international symposium Graph Drawing
Date of publication
2001
Presentation's date
2001-09-25
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants