Nombre de croisements (théorie des graphes) (French Wikipedia)
Analysis of information sources in references of the Wikipedia article "Nombre de croisements (théorie des graphes)" in French language version.
refsWebsite
Global rank
French rank
low place
low place
18th place
118th place
513th place
972nd place
low place
low place
9,635th place
low place
87th place
20th place
low place
low place
1st place
1st place
ams.org
- Richard K. Guy, Proof Techniques in Graph Theory (Proc. Second Ann Arbor Graph Theory Conf., Ann Arbor, Mich., 1968), New York, Academic Press, (MR 0253931), « The decline and fall of Zarankiewicz's theorem », p. 63–69.
- Shengjun Pan et R. Bruce Richter, « The crossing number of K11 is 100 », Journal of Graph Theory, vol. 56, no 2, , p. 128–134 (DOI 10.1002/jgt.20249, MR 2350621).
- Garey, M. R. et Johnson, D. S., « Crossing number is NP-complete », SIAM Journal on Algebraic and Discrete Methods, vol. 4, no 3, , p. 312–316 (DOI 10.1137/0604033, MR 0711340)
- Hliněný, P., « Crossing number is hard for cubic graphs », Journal of Combinatorial Theory, series B, vol. 96, no 4, , p. 455–471 (DOI 10.1016/j.jctb.2005.09.009, MR 2232384)
- M. Grohe, « Computing crossing numbers in quadratic time », Journal of Computer and System Sciences, vol. 68, no 2, , p. 285–302 (DOI 10.1016/j.jcss.2003.07.008, MR 2059096, arXiv cs/0009010)
- Ajtai, M., Chvátal, V., Newborn, M. et Szemerédi, E. « Crossing-free subgraphs » () (MR 0806962)
—Theory and Practice of Combinatorics - Székely, L. A., « Crossing numbers and hard Erdős problems in discrete geometry », Combinatorics, Probability and Computing, vol. 6, no 3, , p. 353–358 (DOI 10.1017/S0963548397002976, MR 1464571)
archive.is
- Oswin Aichholzer, « Rectilinear Crossing Number project » [archive du ], and Rectilinear Crossing Number on the Institute for Software Technology at Graz, University of Technology (2009).
arxiv.org
- E. de Klerk, J. Maharry, D. V. Pasechnik, B. Richter et G. Salazar, « Improved bounds for the crossing numbers of Km,n and Kn », SIAM Journal on Discrete Mathematics, vol. 20, no 1, , p. 189–202 (DOI 10.1137/S0895480104442741, arXiv math/0404142, lire en ligne)
- (en) János Barát et Géza Tóth, « Towards the Albertson Conjecture », .
- Cabello S. and Mohar B., « Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard », SIAM Journal on Computing, vol. 42, no 5, , p. 1803–1829 (DOI 10.1137/120872310, arXiv 1203.5944)
- M. Grohe, « Computing crossing numbers in quadratic time », Journal of Computer and System Sciences, vol. 68, no 2, , p. 285–302 (DOI 10.1016/j.jcss.2003.07.008, MR 2059096, arXiv cs/0009010)
depaul.edu
ovid.cs.depaul.edu
- Marcus Schaefer « Complexity of some geometric and topological problems » (DOI 10.1007/978-3-642-11805-0_32, lire en ligne)
—Graph Drawing, 17th International Symposium, GS 2009 (Chicago, IL, USA, )
— « (ibid.) », dans [...] Revised Papers, Springer-Verlag, coll. « Lecture Notes in Computer Science » (no 5849), (ISBN 978-3-642-11804-3), p. 334–344.
doi.org
dx.doi.org
- (en) Helen C. Purchase, Robert F. Cohen et Murray I. James « Validating graph drawing aesthetics » () (DOI 10.1007/BFb0021827
)
— « (ibid.) », dans Franz-Josef Brandenburg (éd.), Graph Drawing, Symposium on Graph Drawing, GD '95, Passau, Germany, September 20-22, 1995, Proceedings, vol. 1027, Springer, coll. « Lecture Notes in Computer Science », p. 435–446. - P. Turán, « A Note of Welcome », Journal of Graph Theory, vol. 1, , p. 7–9 (DOI 10.1002/jgt.3190010105)
- Edward R. Scheinerman et Herbert S. Wilf, « The rectilinear crossing number of a complete graph and Sylvester's "four point problem" of geometric probability », The American Mathematical Monthly, vol. 101, no 10, , p. 939–943 (DOI 10.2307/2975158, JSTOR 2975158)
- J. Pach et G. Tóth « Proceedings of the 39th Annual Symposium on Foundations of Computer Science (FOCS 1998) » () (DOI 10.1109/SFCS.1998.743512).
- E. de Klerk, J. Maharry, D. V. Pasechnik, B. Richter et G. Salazar, « Improved bounds for the crossing numbers of Km,n and Kn », SIAM Journal on Discrete Mathematics, vol. 20, no 1, , p. 189–202 (DOI 10.1137/S0895480104442741, arXiv math/0404142, lire en ligne)
- T.L. Saaty, « The minimum number of intersections in complete graphs », Proceedings of the National Academy of Sciences of the United States of America, vol. 52, , p. 688–690 (PMID 16591215, PMCID 300329, DOI 10.1073/pnas.52.3.688, Bibcode 1964PNAS...52..688S)
- Shengjun Pan et R. Bruce Richter, « The crossing number of K11 is 100 », Journal of Graph Theory, vol. 56, no 2, , p. 128–134 (DOI 10.1002/jgt.20249, MR 2350621).
- E. T. Pegg et G. Exoo, « Crossing Number Graphs », Mathematica Journal, vol. 11, (DOI 10.3888/tmj.11.2-2)
- Garey, M. R. et Johnson, D. S., « Crossing number is NP-complete », SIAM Journal on Algebraic and Discrete Methods, vol. 4, no 3, , p. 312–316 (DOI 10.1137/0604033, MR 0711340)
- Hliněný, P., « Crossing number is hard for cubic graphs », Journal of Combinatorial Theory, series B, vol. 96, no 4, , p. 455–471 (DOI 10.1016/j.jctb.2005.09.009, MR 2232384)
- Cabello S. and Mohar B., « Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard », SIAM Journal on Computing, vol. 42, no 5, , p. 1803–1829 (DOI 10.1137/120872310, arXiv 1203.5944)
- Marcus Schaefer « Complexity of some geometric and topological problems » (DOI 10.1007/978-3-642-11805-0_32, lire en ligne)
—Graph Drawing, 17th International Symposium, GS 2009 (Chicago, IL, USA, )
— « (ibid.) », dans [...] Revised Papers, Springer-Verlag, coll. « Lecture Notes in Computer Science » (no 5849), (ISBN 978-3-642-11804-3), p. 334–344. - M. Grohe, « Computing crossing numbers in quadratic time », Journal of Computer and System Sciences, vol. 68, no 2, , p. 285–302 (DOI 10.1016/j.jcss.2003.07.008, MR 2059096, arXiv cs/0009010)
- Ken-ichi Kawarabayashi et Bruce Reed « Computing crossing number in linear time » () (DOI 10.1145/1250790.1250848)
—Proceedings of the 29th Annual ACM Symposium on Theory of Computing - Guy Even, Sudipto Guha et Baruch Schieber, « Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas », SIAM Journal on Computing, vol. 32, no 1, , p. 231–252 (DOI 10.1137/S0097539700373520)
- Székely, L. A., « Crossing numbers and hard Erdős problems in discrete geometry », Combinatorics, Probability and Computing, vol. 6, no 3, , p. 353–358 (DOI 10.1017/S0963548397002976, MR 1464571)
haifa.ac.il
sci.haifa.ac.il
- Eyal Ackerman, « On topological graphs with at most four crossings per edge » [archive du ],
harvard.edu
ui.adsabs.harvard.edu
- T.L. Saaty, « The minimum number of intersections in complete graphs », Proceedings of the National Academy of Sciences of the United States of America, vol. 52, , p. 688–690 (PMID 16591215, PMCID 300329, DOI 10.1073/pnas.52.3.688, Bibcode 1964PNAS...52..688S)
jstor.org
- Urie Bronfenbrenner, « The graphic presentation of sociometric data », Sociometry, vol. 7, no 3, , p. 283–289 (JSTOR 2785096) :
« The arrangement of subjects on the diagram, while haphazard in part, is determined largely by trial and error with the aim of minimizing the number of intersecting lines. »
- Edward R. Scheinerman et Herbert S. Wilf, « The rectilinear crossing number of a complete graph and Sylvester's "four point problem" of geometric probability », The American Mathematical Monthly, vol. 101, no 10, , p. 939–943 (DOI 10.2307/2975158, JSTOR 2975158)
nih.gov
ncbi.nlm.nih.gov
- T.L. Saaty, « The minimum number of intersections in complete graphs », Proceedings of the National Academy of Sciences of the United States of America, vol. 52, , p. 688–690 (PMID 16591215, PMCID 300329, DOI 10.1073/pnas.52.3.688, Bibcode 1964PNAS...52..688S)
tilburguniversity.edu
research.tilburguniversity.edu
- E. de Klerk, J. Maharry, D. V. Pasechnik, B. Richter et G. Salazar, « Improved bounds for the crossing numbers of Km,n and Kn », SIAM Journal on Discrete Mathematics, vol. 20, no 1, , p. 189–202 (DOI 10.1137/S0895480104442741, arXiv math/0404142, lire en ligne)
tugraz.at
ist.tugraz.at
- Oswin Aichholzer, « Rectilinear Crossing Number project » [archive du ], and Rectilinear Crossing Number on the Institute for Software Technology at Graz, University of Technology (2009).
dist.ist.tugraz.at
- Oswin Aichholzer, « Rectilinear Crossing Number project » [archive du ], and Rectilinear Crossing Number on the Institute for Software Technology at Graz, University of Technology (2009).
web.archive.org
- Eyal Ackerman, « On topological graphs with at most four crossings per edge » [archive du ],