Login / Signup

Trinque problem: covering complete graphs by plane degree-bounded hypergraphs.

Clément CharpentierSylvain GravierThomas Lecorre
Published in: J. Comb. Optim. (2017)
Keyphrases
  • graph theory
  • graph matching
  • random graphs
  • graph theoretic
  • adjacency matrix
  • bounded treewidth
  • neural network
  • data mining
  • np complete
  • directed graph
  • graph structures
  • subgraph isomorphism
  • labeled graphs