Načrt

Aciklična omrežja

Indeksi in uteži
- Pregled
- Razteg na vozliščne indekse (main path, CPM, tajvan)
- verjetnostni tok
- analiza poti

Porečja
- http://www.mapequation.org/assets/publications/mapequationtutorial.pdf
Druge teme
- analiza “boundary problem” v omrežjih sklicevanj; strategije: stopnje, staranje
- analiza razvija skupine (glavna pot, otok): ključne besede, časopisi, avtorji

Dilworth's theorem

wikipedia: Dilworth's theorem
Theorem of the Day:Dilworth's theorem
Wim Pijls, Rob Potharst: Dilworth's theorem revisited, an algorithmic proof report EI2011-13; Hindawi
L. Haskins, S. Gudder: Height on posets and graphs. Discrete Mathematics, Volume 2, Issue 4, July 1972, Pages 357–382
Anne Kaldewaij: Some algorithms based on the dual of Dilworth's theorem. Science of Computer Programming, Volume 9, Issue 1, August 1987, Pages 85–89
wikipedia: Mirsky's theorem

wikipedia
Aho, A.V., Garey, M.R., Ullman, J.D.: The transitive reduction of a directed graph. SIAM Journal on Computing 1(1972)2: 131–137
Goralčíková, A., Koubek, V.: A reduct-and-closure algorithm for graphs. Mathematical Foundations of Computer Science 1979, Lecture Notes in Computer Science Volume 74, 1979, pp 301-307
Klaus Simon: An improved algorithm for transitive closure on acyclic digraphs. Automata, Languages and Programming. Lecture Notes in Computer Science Volume, 226, 1986, pp 376-386
Habib, M., Morvan, M., Rampon, J.-X.: On the calculation of transitive reduction—closure of orders. Discrete Mathematics, Volume 111, Issues 1–3, 22 February 1993, Pages 289–303

Hummon, N.P., Doreian, P.: Connectivity in a citation network:The development of DNA. Social Networks 11 (1989), 39–63