• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c <= 12.

Drago BokalZdenek DvorákPetr HlinenýJesús LeañosBojan MoharTilo Wiedera
Published in: SoCG (2019)
Keyphrases
  • bounded degree
  • graph theoretic
  • bounded treewidth
  • np complete
  • directed graph
  • reinforcement learning
  • social network analysis
  • learning tasks
  • graph matching
  • graph theory
  • graph representation