Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:2741531
Jump to:navigation, search

zbMath0990.90530MaRDI QIDQ2741531

Ondřej Čepek, Alexander Kogan, Endre Boros, Kazuhisa Makino, Ewald Speckenmeyer, Peter L. Hammer, Bert Randerath, Bruno Simeone

Publication date: 24 September 2001


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

combinatorial embedding problemslevel graphs


Mathematics Subject Classification ID

Combinatorial optimization (90C27)


Related Items (6)

Beyond Level Planarity ⋮ Unnamed Item ⋮ A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs ⋮ Satisfiability of mixed Horn formulas ⋮ Practical Level Planarity Testing and Layout with Embedding Constraints ⋮ On Some Aspects of Mixed Horn Formulas



Cites Work

  • Crossing Number is NP-Complete
  • Hierarchies and planarity theory


This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2741531&oldid=15605115"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 14:22.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki