ผลต่างระหว่างรุ่นของ "Reconstruction problems"
ไปยังการนำทาง
ไปยังการค้นหา
Jittat (คุย | มีส่วนร่วม) |
Jittat (คุย | มีส่วนร่วม) |
||
| แถว 1: | แถว 1: | ||
== Materials == | == Materials == | ||
* Graph reconstruction | * Graph reconstruction | ||
| − | ** [https://en.wikipedia.org/wiki/Graph_realization_problem Graph realization] from [http://mathworld.wolfram.com/DegreeSequence.html Degree sequence] (simple graph case) | + | ** [https://en.wikipedia.org/wiki/Graph_realization_problem Graph realization] from [http://mathworld.wolfram.com/DegreeSequence.html Degree sequence] (simple graph case). This case is solvable with the [https://en.wikipedia.org/wiki/Havel%E2%80%93Hakimi_algorithm Havel-Hakimi algorithm] which is a greedy recursive algorithm. |
*** See also the [https://en.wikipedia.org/wiki/Bipartite_realization_problem bipartite case] and [https://en.wikipedia.org/wiki/Digraph_realization_problem directed graph case]. (Not sure if they are approachable.) | *** See also the [https://en.wikipedia.org/wiki/Bipartite_realization_problem bipartite case] and [https://en.wikipedia.org/wiki/Digraph_realization_problem directed graph case]. (Not sure if they are approachable.) | ||
รุ่นแก้ไขเมื่อ 14:07, 21 มีนาคม 2559
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
