[[
notes:net:acy
]]
Vlado
Trace:
•
acy
This is an old revision of the document!
Table of Contents
Acyclic networks
Dilworth's theorem
Transitivity reduction / skeleton
Acyclic
Acyclic networks
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
Transitivity reduction / skeleton
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
Acyclic
Hummon, N.P., Doreian, P.:
Connectivity in a citation network:The development of DNA.
Social Networks 11 (1989), 39–63
notes/net/acy.1437077015.txt.gz · Last modified: 2015/07/16 22:03 by vlado
Except where otherwise noted, content on this wiki is licensed under the following license:
CC Attribution-Noncommercial-Share Alike 3.0 Unported
