有向无环图 (Chinese Wikipedia)

Analysis of information sources in references of the Wikipedia article "有向无环图" in Chinese language version.

refsWebsite

Global rank Chinese rank

25web.archive.org

1^st place

20books.google.com

3^rd place

8^th place

14doi.org

2^nd place

23^rd place

2wikipedia.org

low place

2nih.gov

4^th place

5^th place

1wolfram.com

513^th place

358^th place

1uwaterloo.ca

3,153^rd place

2,506^th place

1mit.edu

415^th place

500^th place

1ams.org

451^st place

935^th place

1archive.org

6^th place

4^th place

1etsmtl.ca

low place

1acm.org

1,185^th place

809^th place

1upenn.edu

702^nd place

1,153^rd place

1harvard.edu

18^th place

57^th place

1arxiv.org

69^th place

254^th place

1psu.edu

207^th place

628^th place

acm.org (Global: 1,185^th place; Chinese: 809^th place)

dl.acm.org

Bender, Michael A.; Pemmasani, Giridhar; Skiena, Steven; Sumazin, Pavel, Finding least common ancestors in directed acyclic graphs, Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '01), Philadelphia, PA, USA: Society for Industrial and Applied Mathematics: 845–854, 2001 [2020-02-08], ISBN 978-0-89871-490-6, （原始内容存档于2018-12-01） .

ams.org (Global: 451^st place; Chinese: 935^th place)

Picard, Jean-Claude, Maximal closure of a graph and applications to combinatorial problems, Management Science（英语：Management Science (journal)）, 1976, 22 (11): 1268–1272, MR 0403596, doi:10.1287/mnsc.22.11.1268 .

archive.org (Global: 6^th place; Chinese: 4^th place)

Pearl, Judea. Causal diagrams for empirical research. Biometrika. 1995, 82 (4): 669–709. doi:10.1093/biomet/82.4.669.

arxiv.org (Global: 69^th place; Chinese: 254^th place)

Clough, James R.; Gollings, Jamie; Loach, Tamar V.; Evans, Tim S., Transitive reduction of citation networks, Journal of Complex Networks, 2015, 3 (2): 189–203, arXiv:1310.8224 , doi:10.1093/comnet/cnu039 .

books.google.com (Global: 3^rd place; Chinese: 8^th place)

Mitrani, I., Simulation Techniques for Discrete Event Systems, Cambridge Computer Science Texts 14, Cambridge University Press: 27, 1982 [2020-01-18], ISBN 9780521282826, （原始内容存档于2021-03-10） .
Kozen, Dexter, The Design and Analysis of Algorithms, Monographs in Computer Science, Springer: 9, 1992 [2020-01-14], ISBN 978-0-387-97687-7, （原始内容存档于2021-03-10） .
Banerjee, Utpal, Exercise 2(c), Loop Transformations for Restructuring Compilers: The Foundations, Springer: 19, 1993 [2020-01-14], ISBN 978-0-7923-9318-4, （原始内容存档于2021-03-10） .
Bang-Jensen, Jørgen; Gutin, Gregory Z., 2.3 Transitive Digraphs, Transitive Closures and Reductions, Digraphs: Theory, Algorithms and Applications, Springer Monographs in Mathematics, Springer: 36–39, 2008 [2020-01-14], ISBN 978-1-84800-998-1, （原始内容存档于2021-03-10） .
Jungnickel, Dieter, Graphs, Networks and Algorithms, Algorithms and Computation in Mathematics 5, Springer: 92–93, 2012 [2020-01-15], ISBN 978-3-642-32278-5, （原始内容存档于2021-03-10） .
Sedgewick, Robert; Wayne, Kevin, 4,2,25 Unique topological ordering, Algorithms 4th, Addison-Wesley: 598–599, 2011 [2020-01-17], ISBN 978-0-13-276256-4, （原始内容存档于2021-03-10） .
Bender, Edward A.; Williamson, S. Gill, Example 26 (Linear extensions – topological sorts), A Short Course in Discrete Mathematics, Dover Books on Computer Science, Courier Dover Publications: 142, 2005 [2020-01-17], ISBN 978-0-486-43946-4, （原始内容存档于2021-03-10） .
For depth-first search based topological sorting algorithm, this validity check can be interleaved with the topological sorting algorithm itself; see e.g. Skiena, Steven S., The Algorithm Design Manual, Springer: 179–181, 2009 [2020-01-21], ISBN 978-1-84800-070-4, （原始内容存档于2021-03-10） .
Gross, Jonathan L.; Yellen, Jay; Zhang, Ping, Handbook of Graph Theory 2nd, CRC Press: 1181, 2013 [2020-01-30], ISBN 978-1-4398-8018-0, （原始内容存档于2021-03-10） .
Srikant, Y. N.; Shankar, Priti, The Compiler Design Handbook: Optimizations and Machine Code Generation 2nd, CRC Press: 19–39, 2007 [2020-01-30], ISBN 978-1-4200-4383-9, （原始内容存档于2021-03-10） .
Wang, John X., What Every Engineer Should Know About Decision Making Under Uncertainty, CRC Press: 160, 2002 [2020-01-31], ISBN 978-0-8247-4373-4, （原始内容存档于2021-03-10） .
Sapatnekar, Sachin, Timing, Springer: 133, 2004 [2020-02-03], ISBN 978-1-4020-7671-8, （原始内容存档于2021-03-10） .
Touati, Sid; de Dinechin, Benoit, Advanced Backend Optimization, John Wiley & Sons: 123, 2014 [2020-02-04], ISBN 978-1-118-64894-0, （原始内容存档于2021-03-10） .
Gopnik, Alison; Schulz, Laura, Causal Learning, Oxford University Press: 4, 2007 [2020-06-01], ISBN 978-0-19-803928-0, （原始内容存档于2021-03-10） .
Shmulevich, Ilya; Dougherty, Edward R., Probabilistic Boolean Networks: The Modeling and Control of Gene Regulatory Networks, Society for Industrial and Applied Mathematics: 58, 2010 [2020-06-01], ISBN 978-0-89871-692-4, （原始内容存档于2021-03-10） .
Dorf, Richard C., The Technology Management Handbook, CRC Press: 9-7, 1998 [2020-06-01], ISBN 978-0-8493-8577-3, （原始内容存档于2021-03-10） .
Boslaugh, Sarah, Encyclopedia of Epidemiology, Volume 1, SAGE: 255, 2008 [2020-06-01], ISBN 978-1-4129-2816-8, （原始内容存档于2021-03-10） .
Bartlang, Udo, Architecture and Methods for Flexible Content Management in Peer-to-Peer Systems, Springer: 59, 2010 [2020-05-31], ISBN 978-3-8348-9645-2, （原始内容存档于2021-03-10） .
Pach, János; Sharir, Micha, Combinatorial Geometry and Its Algorithmic Applications: The Alcalá Lectures, Mathematical surveys and monographs 152, American Mathematical Society: 93–94, [2020-06-01], ISBN 978-0-8218-7533-9, （原始内容存档于2021-03-10） .
Lothaire, M., Applied Combinatorics on Words, Encyclopedia of Mathematics and its Applications 105, Cambridge University Press: 18, 2005 [2020-06-01], ISBN 9780521848022, （原始内容存档于2021-03-10） .

doi.org (Global: 2^nd place; Chinese: 23^rd place)

Furnas, George W.; Zacks, Jeff, Multitrees: enriching and reusing hierarchical structure, Proc. SIGCHI conference on Human Factors in Computing Systems (CHI '94): 330–336, 1994, ISBN 978-0897916509, doi:10.1145/191666.191778 .
Stanley, Richard P., Acyclic orientations of graphs (PDF), Discrete Mathematics, 1973, 5 (2): 171–178 [2020-01-22], doi:10.1016/0012-365X(73)90108-8, （原始内容存档 (PDF)于2021-02-24） .
Picard, Jean-Claude, Maximal closure of a graph and applications to combinatorial problems, Management Science（英语：Management Science (journal)）, 1976, 22 (11): 1268–1272, MR 0403596, doi:10.1287/mnsc.22.11.1268 .
Al-Mutawa, H. A.; Dietrich, J.; Marsland, S.; McCartin, C., On the shape of circular dependencies in Java programs, 23rd Australian Software Engineering Conference, IEEE: 48–57, 2014, ISBN 978-1-4799-3149-1, doi:10.1109/ASWEC.2014.15 .
Dennis, Jack B., First version of a data flow procedure language, Programming Symposium, Lecture Notes in Computer Science 19: 362–376, 1974, ISBN 978-3-540-06859-4, doi:10.1007/3-540-06859-7_145 .
Pearl, Judea. Causal diagrams for empirical research. Biometrika. 1995, 82 (4): 669–709. doi:10.1093/biomet/82.4.669.
Kirkpatrick, Bonnie B., Haplotypes versus genotypes on pedigrees, Algorithms for Molecular Biology, April 2011, 6 (10): 10, PMC 3102622 , PMID 21504603, doi:10.1186/1748-7188-6-10 .
McGuffin, M. J.; Balakrishnan, R., Interactive visualization of genealogical graphs (PDF), IEEE Symposium on Information Visualization (INFOVIS 2005): 16–23, 2005 [2020-02-07], ISBN 978-0-7803-9464-3, doi:10.1109/INFVIS.2005.1532124, （原始内容存档 (PDF)于2021-02-24） .
Price, Derek J. de Solla, Networks of Scientific Papers (PDF), Science, July 30, 1965, 149 (3683): 510–515 [2020-06-01], Bibcode:1965Sci...149..510D, PMID 14325149, doi:10.1126/science.149.3683.510, （原始内容存档 (PDF)于2019-05-20） .
Clough, James R.; Gollings, Jamie; Loach, Tamar V.; Evans, Tim S., Transitive reduction of citation networks, Journal of Complex Networks, 2015, 3 (2): 189–203, arXiv:1310.8224 , doi:10.1093/comnet/cnu039 .
Crochemore, Maxime; Vérin, Renaud, Direct construction of compact directed acyclic word graphs, Combinatorial Pattern Matching, Lecture Notes in Computer Science 1264, Springer: 116–129, 1997, CiteSeerX 10.1.1.53.6273 , ISBN 978-3-540-63220-7, doi:10.1007/3-540-63220-4_55 .
Lee, C. Y., Representation of switching circuits by binary-decision programs, Bell System Technical Journal, 1959, 38 (4): 985–999, doi:10.1002/j.1538-7305.1959.tb01585.x .
Akers, Sheldon B., Binary decision diagrams, IEEE Transactions on Computers, 1978, C–27 (6): 509–516, doi:10.1109/TC.1978.1675141 .
Friedman, S. J.; Supowit, K. J., Finding the optimal variable ordering for binary decision diagrams, Proc. 24th ACM/IEEE Design Automation Conference (DAC '87), New York, NY, USA: ACM: 348–356, 1987, ISBN 978-0-8186-0781-3, doi:10.1145/37888.37941 .

etsmtl.ca (Global: low place; Chinese: low place)

profs.etsmtl.ca

McGuffin, M. J.; Balakrishnan, R., Interactive visualization of genealogical graphs (PDF), IEEE Symposium on Information Visualization (INFOVIS 2005): 16–23, 2005 [2020-02-07], ISBN 978-0-7803-9464-3, doi:10.1109/INFVIS.2005.1532124, （原始内容存档 (PDF)于2021-02-24） .

harvard.edu (Global: 18^th place; Chinese: 57^th place)

ui.adsabs.harvard.edu

Price, Derek J. de Solla, Networks of Scientific Papers (PDF), Science, July 30, 1965, 149 (3683): 510–515 [2020-06-01], Bibcode:1965Sci...149..510D, PMID 14325149, doi:10.1126/science.149.3683.510, （原始内容存档 (PDF)于2019-05-20） .

mit.edu (Global: 415^th place; Chinese: 500^th place)

math.mit.edu

Stanley, Richard P., Acyclic orientations of graphs (PDF), Discrete Mathematics, 1973, 5 (2): 171–178 [2020-01-22], doi:10.1016/0012-365X(73)90108-8, （原始内容存档 (PDF)于2021-02-24） .

nih.gov (Global: 4^th place; Chinese: 5^th place)

ncbi.nlm.nih.gov

Kirkpatrick, Bonnie B., Haplotypes versus genotypes on pedigrees, Algorithms for Molecular Biology, April 2011, 6 (10): 10, PMC 3102622 , PMID 21504603, doi:10.1186/1748-7188-6-10 .
Price, Derek J. de Solla, Networks of Scientific Papers (PDF), Science, July 30, 1965, 149 (3683): 510–515 [2020-06-01], Bibcode:1965Sci...149..510D, PMID 14325149, doi:10.1126/science.149.3683.510, （原始内容存档 (PDF)于2019-05-20） .

psu.edu (Global: 207^th place; Chinese: 628^th place)

citeseerx.ist.psu.edu

Crochemore, Maxime; Vérin, Renaud, Direct construction of compact directed acyclic word graphs, Combinatorial Pattern Matching, Lecture Notes in Computer Science 1264, Springer: 116–129, 1997, CiteSeerX 10.1.1.53.6273 , ISBN 978-3-540-63220-7, doi:10.1007/3-540-63220-4_55 .

upenn.edu (Global: 702^nd place; Chinese: 1,153^rd place)

garfield.library.upenn.edu

Price, Derek J. de Solla, Networks of Scientific Papers (PDF), Science, July 30, 1965, 149 (3683): 510–515 [2020-06-01], Bibcode:1965Sci...149..510D, PMID 14325149, doi:10.1126/science.149.3683.510, （原始内容存档 (PDF)于2019-05-20） .

uwaterloo.ca (Global: 3,153^rd place; Chinese: 2,506^th place)

cs.uwaterloo.ca

McKay, B. D.; Royle, G. F.; Wanless, I. M.; Oggier, F. E.; Sloane, N. J. A.; Wilf, H., Acyclic digraphs and eigenvalues of (0,1)-matrices, Journal of Integer Sequences, 2004, 7 [2020-01-19], （原始内容存档于2021-02-24） , Article 04.3.3.

web.archive.org (Global: 1^st place; Chinese: 1^st place)

Mitrani, I., Simulation Techniques for Discrete Event Systems, Cambridge Computer Science Texts 14, Cambridge University Press: 27, 1982 [2020-01-18], ISBN 9780521282826, （原始内容存档于2021-03-10） .
Kozen, Dexter, The Design and Analysis of Algorithms, Monographs in Computer Science, Springer: 9, 1992 [2020-01-14], ISBN 978-0-387-97687-7, （原始内容存档于2021-03-10） .
Banerjee, Utpal, Exercise 2(c), Loop Transformations for Restructuring Compilers: The Foundations, Springer: 19, 1993 [2020-01-14], ISBN 978-0-7923-9318-4, （原始内容存档于2021-03-10） .
Bang-Jensen, Jørgen; Gutin, Gregory Z., 2.3 Transitive Digraphs, Transitive Closures and Reductions, Digraphs: Theory, Algorithms and Applications, Springer Monographs in Mathematics, Springer: 36–39, 2008 [2020-01-14], ISBN 978-1-84800-998-1, （原始内容存档于2021-03-10） .
Jungnickel, Dieter, Graphs, Networks and Algorithms, Algorithms and Computation in Mathematics 5, Springer: 92–93, 2012 [2020-01-15], ISBN 978-3-642-32278-5, （原始内容存档于2021-03-10） .
Sedgewick, Robert; Wayne, Kevin, 4,2,25 Unique topological ordering, Algorithms 4th, Addison-Wesley: 598–599, 2011 [2020-01-17], ISBN 978-0-13-276256-4, （原始内容存档于2021-03-10） .
Bender, Edward A.; Williamson, S. Gill, Example 26 (Linear extensions – topological sorts), A Short Course in Discrete Mathematics, Dover Books on Computer Science, Courier Dover Publications: 142, 2005 [2020-01-17], ISBN 978-0-486-43946-4, （原始内容存档于2021-03-10） .
McKay, B. D.; Royle, G. F.; Wanless, I. M.; Oggier, F. E.; Sloane, N. J. A.; Wilf, H., Acyclic digraphs and eigenvalues of (0,1)-matrices, Journal of Integer Sequences, 2004, 7 [2020-01-19], （原始内容存档于2021-02-24） , Article 04.3.3.
For depth-first search based topological sorting algorithm, this validity check can be interleaved with the topological sorting algorithm itself; see e.g. Skiena, Steven S., The Algorithm Design Manual, Springer: 179–181, 2009 [2020-01-21], ISBN 978-1-84800-070-4, （原始内容存档于2021-03-10） .
Stanley, Richard P., Acyclic orientations of graphs (PDF), Discrete Mathematics, 1973, 5 (2): 171–178 [2020-01-22], doi:10.1016/0012-365X(73)90108-8, （原始内容存档 (PDF)于2021-02-24） .
Gross, Jonathan L.; Yellen, Jay; Zhang, Ping, Handbook of Graph Theory 2nd, CRC Press: 1181, 2013 [2020-01-30], ISBN 978-1-4398-8018-0, （原始内容存档于2021-03-10） .
Srikant, Y. N.; Shankar, Priti, The Compiler Design Handbook: Optimizations and Machine Code Generation 2nd, CRC Press: 19–39, 2007 [2020-01-30], ISBN 978-1-4200-4383-9, （原始内容存档于2021-03-10） .
Wang, John X., What Every Engineer Should Know About Decision Making Under Uncertainty, CRC Press: 160, 2002 [2020-01-31], ISBN 978-0-8247-4373-4, （原始内容存档于2021-03-10） .
Sapatnekar, Sachin, Timing, Springer: 133, 2004 [2020-02-03], ISBN 978-1-4020-7671-8, （原始内容存档于2021-03-10） .
Touati, Sid; de Dinechin, Benoit, Advanced Backend Optimization, John Wiley & Sons: 123, 2014 [2020-02-04], ISBN 978-1-118-64894-0, （原始内容存档于2021-03-10） .
Gopnik, Alison; Schulz, Laura, Causal Learning, Oxford University Press: 4, 2007 [2020-06-01], ISBN 978-0-19-803928-0, （原始内容存档于2021-03-10） .
Shmulevich, Ilya; Dougherty, Edward R., Probabilistic Boolean Networks: The Modeling and Control of Gene Regulatory Networks, Society for Industrial and Applied Mathematics: 58, 2010 [2020-06-01], ISBN 978-0-89871-692-4, （原始内容存档于2021-03-10） .
Dorf, Richard C., The Technology Management Handbook, CRC Press: 9-7, 1998 [2020-06-01], ISBN 978-0-8493-8577-3, （原始内容存档于2021-03-10） .
Boslaugh, Sarah, Encyclopedia of Epidemiology, Volume 1, SAGE: 255, 2008 [2020-06-01], ISBN 978-1-4129-2816-8, （原始内容存档于2021-03-10） .
McGuffin, M. J.; Balakrishnan, R., Interactive visualization of genealogical graphs (PDF), IEEE Symposium on Information Visualization (INFOVIS 2005): 16–23, 2005 [2020-02-07], ISBN 978-0-7803-9464-3, doi:10.1109/INFVIS.2005.1532124, （原始内容存档 (PDF)于2021-02-24） .
Bender, Michael A.; Pemmasani, Giridhar; Skiena, Steven; Sumazin, Pavel, Finding least common ancestors in directed acyclic graphs, Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '01), Philadelphia, PA, USA: Society for Industrial and Applied Mathematics: 845–854, 2001 [2020-02-08], ISBN 978-0-89871-490-6, （原始内容存档于2018-12-01） .
Bartlang, Udo, Architecture and Methods for Flexible Content Management in Peer-to-Peer Systems, Springer: 59, 2010 [2020-05-31], ISBN 978-3-8348-9645-2, （原始内容存档于2021-03-10） .
Pach, János; Sharir, Micha, Combinatorial Geometry and Its Algorithmic Applications: The Alcalá Lectures, Mathematical surveys and monographs 152, American Mathematical Society: 93–94, [2020-06-01], ISBN 978-0-8218-7533-9, （原始内容存档于2021-03-10） .
Price, Derek J. de Solla, Networks of Scientific Papers (PDF), Science, July 30, 1965, 149 (3683): 510–515 [2020-06-01], Bibcode:1965Sci...149..510D, PMID 14325149, doi:10.1126/science.149.3683.510, （原始内容存档 (PDF)于2019-05-20） .
Lothaire, M., Applied Combinatorics on Words, Encyclopedia of Mathematics and its Applications 105, Cambridge University Press: 18, 2005 [2020-06-01], ISBN 9780521848022, （原始内容存档于2021-03-10） .

wikipedia.org (Global: low place; Chinese: low place)

en.wikipedia.org

Cormen, Thomas H. （英语：Thomas H. Cormen）; Leiserson, Charles E. （英语：Charles E. Leiserson）; Rivest, Ronald L.; Stein, Clifford. Introduction to Algorithms 2nd. MIT Press and McGraw-Hill. 2001 [1990]. ISBN 0-262-03293-7. Section 22.4, Topological sort, pp. 549–552.
Picard, Jean-Claude, Maximal closure of a graph and applications to combinatorial problems, Management Science（英语：Management Science (journal)）, 1976, 22 (11): 1268–1272, MR 0403596, doi:10.1287/mnsc.22.11.1268 .

wolfram.com (Global: 513^th place; Chinese: 358^th place)

mathworld.wolfram.com

Weisstein, Eric W. (编). Weisstein's Conjecture. at MathWorld--A Wolfram Web Resource. Wolfram Research, Inc. （英语）.

有向无环图 (Chinese Wikipedia)

acm.org (Global: 1,185th place; Chinese: 809th place)

dl.acm.org

ams.org (Global: 451st place; Chinese: 935th place)

archive.org (Global: 6th place; Chinese: 4th place)

arxiv.org (Global: 69th place; Chinese: 254th place)

books.google.com (Global: 3rd place; Chinese: 8th place)

doi.org (Global: 2nd place; Chinese: 23rd place)