Sign in

Beyond-Planar Graphs: Combinatorics, Models and Algorithms (Dagstuhl Seminar 19092).

Seok-Hee HongMichael KaufmannJános PachCsaba D. Tóth
Published in: Dagstuhl Reports (2019)
Keyphrases
  • planar graphs
  • graph theory
  • computational complexity
  • probabilistic model
  • optimization problems
  • random fields
  • max cut