Login / Signup

) Time Edge-Splitting Algorithm in Undirected Graphs.

Hiroshi NagamochiS. NakamuraToshihide Ibaraki
Published in: Algorithmica (2000)
Keyphrases
  • undirected graph
  • dynamic programming
  • search space
  • directed graph
  • np hard
  • expectation maximization
  • optimal solution
  • pairwise
  • probabilistic model
  • worst case
  • edge detection
  • linear programming
  • generative model