lukashuebner/HyperPhylo

Issues

• Use KaHyPar's hypergraph DS

  #22 opened 6 years ago by SebastianSchlag
  0

• Use (bipartite) Graph as main set cover DS

  #23 opened 6 years ago by SebastianSchlag
  0

• Don't allocate large objects within loops...

  #26 opened 6 years ago by SebastianSchlag
  0

• Compare JDP results with LPP results

  #27 opened 6 years ago by SebastianSchlag
  2

• Proofread and assert Pairwise Distance Implementation

  #28 opened 6 years ago by poettig
  0

• Think about representations for E and S

  #24 opened 6 years ago by SebastianSchlag
  0

• Mail mit Ergebnissen + Benoit nach 1-Partitionssätzen fragen

  #29 opened 6 years ago by poettig
  0

• Compare quality of naive vs clever splitting

  #19 opened 6 years ago by adrianzap
  0

• Erweiterung auf n Partitionen

  #6 opened 6 years ago by poettig
  1

• Initiale Lösung für KaHyPar

  #7 opened 6 years ago by poettig
  3

• Two Step Approach von Alexis in Betracht ziehen

  #9 opened 6 years ago by poettig
  1

• Write NP-completeness proof formally

  #21 opened 6 years ago by adrianzap
  1

• Make sure that inputs for set_difference are sorted

  #25 opened 6 years ago by SebastianSchlag
  1

• Fix judicious partitioning runtime/memory consumption

  #20 opened 6 years ago by adrianzap
  0

• Alternatividee von Sebastian prüfen

  #8 opened 7 years ago by poettig
  1

• Use a different, possible inexact, hypergraph formulation of the problem that can be more easily handled by Sebastian's framework.

  #13 opened 7 years ago by lukashuebner
  0

• Test in practice on empirical test datasets (let Benoit know if you need more) if it matters and how many of those dangling vertices will actually occur.

  #12 opened 7 years ago by lukashuebner
  0

• Think about an algorithm for optimally assigning dangling vertices.

  #11 opened 7 years ago by lukashuebner
  0

• Sebastians Antwort auf Dual Graph Kritik nachvollziehen

  #10 opened 7 years ago by lukashuebner
  0

• Split one partition more cleverly (e.g. via KaHyPar)

  #18 opened 7 years ago by adrianzap
  1

• NP-complete Beweis für n CPUs

  #3 opened 7 years ago by poettig
  0

• Verfahren mit PaToH testen

  #4 opened 7 years ago by poettig
  1

• Sebastians Einwand überprüfen

  #5 opened 7 years ago by poettig
  1

• Split one partition naively

  #17 opened 7 years ago by adrianzap
  0

• Email Sabine prüfen

  #14 opened 7 years ago by poettig
  2

• Definition Team1 prüfen

  #15 opened 7 years ago by poettig
  0

• Upper Bound Sebastian

  #16 opened 7 years ago by poettig
  1

• Hypergraphrepräsentation

  #1 opened 7 years ago by poettig
  0

• Capacity Constraint Paper an Sebastian

  #2 opened 7 years ago by poettig
  0