Login / Signup

A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs.

Robert BredereckVincent FroeseMarcel KoselerMarcelo Garlet MillaniAndré NichterleinRolf Niedermeier
Published in: IPEC (2016)
Keyphrases
  • directed graph
  • information extraction
  • shortest path problem
  • decision trees
  • np complete
  • random walk
  • lightweight
  • benchmark problems
  • problems involving