Reconstruction problems
รุ่นแก้ไขเมื่อ 14:07, 21 มีนาคม 2559 โดย Jittat (คุย | มีส่วนร่วม)
Materials
- Graph reconstruction
- Graph realization from Degree sequence (simple graph case). This case is solvable with the Havel-Hakimi algorithm which is a greedy recursive algorithm.
- See also the bipartite case and directed graph case. (Not sure if they are approachable.)
- Graph realization from Degree sequence (simple graph case). This case is solvable with the Havel-Hakimi algorithm which is a greedy recursive algorithm.
- Phylogenetic tree reconstructions
- part1
- part2 - distance based
- All lecture notes: all notes
Tasks
- codeforces 329C - Graph reconstruction