Login / Signup

Partition Into Triangles on Bounded Degree Graphs.

Johan M. M. van RooijMarcel E. van Kooten NiekerkHans L. Bodlaender
Published in: Theory Comput. Syst. (2013)
Keyphrases
  • bounded degree
  • graph theoretic
  • bounded treewidth
  • graph theory
  • massive graphs
  • graph matching
  • reachability queries
  • computational complexity
  • np complete
  • first order logic
  • directed graph
  • data objects