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

On the Parameterized Complexity of Computing Graph Bisections.

René van BevernAndreas Emil FeldmannManuel SorgeOndrej Suchý
Published in: WG (2013)
Keyphrases
  • parameterized complexity
  • random walk
  • structured data
  • weighted graph
  • information extraction
  • graph theory
  • knowledge base
  • data management
  • graph structure