Implicit graph (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Implicit graph" in English language version.

refsWebsite

Global rank English rank

16doi.org

2^nd place

6ams.org

451^st place

277^th place

5semanticscholar.org

11^th place

8^th place

5arxiv.org

69^th place

59^th place

3web.archive.org

1^st place

2books.google.com

3^rd place

1aaai.org

9,352^nd place

5,696^th place

1berkeley.edu

580^th place

462^nd place

1uci.edu

3,063^rd place

2,041^st place

1cwi.nl

low place

1it-c.dk

low place

1labri.fr

low place

1psu.edu

207^th place

136^th place

aaai.org (Global: 9,352^nd place; English: 5,696^th place)

Korf, Richard E. (2008), "Minimizing disk I/O in two-bit breadth-first search" (PDF), Proc. 23rd AAAI Conf. on Artificial Intelligence, pp. 317–324, The standard 3×3×3 Rubik's Cube contains 4.3252 × 10¹⁹ states, and is too large to search exhaustively.

ams.org (Global: 451^st place; English: 277^th place)

mathscinet.ams.org

Korf, Richard E. (2008), "Linear-time disk-based implicit graph search", Journal of the ACM, 55 (6) 26: 1–40, doi:10.1145/1455248.1455250, MR 2477486, S2CID 13969607.
Childs, Andrew M.; Cleve, Richard; Deotto, Enrico; Farhi, Edward; Gutmann, Sam; Spielman, Daniel A. (2003), "Exponential algorithmic speedup by a quantum walk", Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, New York: ACM, pp. 59–68, arXiv:quant-ph/0209131, doi:10.1145/780542.780552, ISBN 1-58113-674-9, MR 2121062, S2CID 308884.
Kannan, Sampath; Naor, Moni; Rudich, Steven (1992), "Implicit representation of graphs", SIAM Journal on Discrete Mathematics, 5 (4): 596–603, doi:10.1137/0405049, MR 1186827.
Ma, Tze Heng; Spinrad, Jeremy P. (1991), "Cycle-free partial orders and chordal comparability graphs", Order, 8 (1): 49–61, doi:10.1007/BF00385814, MR 1129614, S2CID 120479154.
Curtis, Andrew R.; Izurieta, Clemente; Joeris, Benson; Lundberg, Scott; McConnell, Ross M. (2010), "An implicit representation of chordal comparability graphs in linear time", Discrete Applied Mathematics, 158 (8): 869–875, doi:10.1016/j.dam.2010.01.005, MR 2602811.
Bender, Michael A.; Ron, Dana (2000), "Testing acyclicity of directed graphs in sublinear time", Automata, languages and programming (Geneva, 2000), Lecture Notes in Comput. Sci., vol. 1853, Berlin: Springer, pp. 809–820, doi:10.1007/3-540-45022-X_68, ISBN 978-3-540-67715-4, MR 1795937.

arxiv.org (Global: 69^th place; English: 59^th place)

Yannakakis, Mihalis (2009), "Equilibria, fixed points, and complexity classes", Computer Science Review, 3 (2): 71–85, arXiv:0802.2831, doi:10.1016/j.cosrev.2009.03.004.
Childs, Andrew M.; Cleve, Richard; Deotto, Enrico; Farhi, Edward; Gutmann, Sam; Spielman, Daniel A. (2003), "Exponential algorithmic speedup by a quantum walk", Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, New York: ACM, pp. 59–68, arXiv:quant-ph/0209131, doi:10.1145/780542.780552, ISBN 1-58113-674-9, MR 2121062, S2CID 308884.
Hatami, Hamed; Hatami, Pooya (2022), "The implicit graph conjecture is false", 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022, Denver, CO, USA, October 31 – November 3, 2022, IEEE, pp. 1134–1137, arXiv:2111.13198, doi:10.1109/FOCS54457.2022.00109
Bonamy, Marthe; Gavoille, Cyril; Pilipczuk, Michał (2020), "Shorter Labeling Schemes for Planar Graphs", Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, pp. 446–462, arXiv:1908.03341, doi:10.1007/978-3-540-75520-3_52.
Dujmović, Vida; Esperet, Louis; Joret, Gwenaël; Gavoille, Cyril; Micek, Piotr; Morin, Pat (2020), "Adjacency Labelling for Planar Graphs (and Beyond)", 61st IEEE Annual Symposium on Foundations of Computer Science, pp. 577–588, arXiv:2003.04280, doi:10.1007/978-3-540-75520-3_52.

berkeley.edu (Global: 580^th place; English: 462^nd place)

cs.berkeley.edu

Papadimitriou, Christos (1994), "On the complexity of the parity argument and other inefficient proofs of existence" (PDF), Journal of Computer and System Sciences, 48 (3): 498–532, doi:10.1016/S0022-0000(05)80063-7, archived from the original (PDF) on 2016-03-04, retrieved 2011-07-12

books.google.com (Global: 3^rd place; English: 3^rd place)

Immerman, Neil (1999), "Exercise 3.7 (Everything is a Graph)", Descriptive Complexity, Graduate Texts in Computer Science, Springer-Verlag, p. 48, ISBN 978-0-387-98600-5.
Spinrad, Jeremy P. (2003), "2. Implicit graph representation", Efficient Graph Representations, American Mathematical Soc., pp. 17–30, ISBN 0-8218-2815-0.

cwi.nl (Global: low place; English: low place)

homepages.cwi.nl

Kang, Ross J.; Müller, Tobias (2011), Sphere and dot product representations of graphs (PDF), archived from the original (PDF) on 2012-03-16, retrieved 2011-07-12.

doi.org (Global: 2^nd place; English: 2^nd place)

Korf, Richard E. (2008), "Linear-time disk-based implicit graph search", Journal of the ACM, 55 (6) 26: 1–40, doi:10.1145/1455248.1455250, MR 2477486, S2CID 13969607.
Papadimitriou, Christos (1994), "On the complexity of the parity argument and other inefficient proofs of existence" (PDF), Journal of Computer and System Sciences, 48 (3): 498–532, doi:10.1016/S0022-0000(05)80063-7, archived from the original (PDF) on 2016-03-04, retrieved 2011-07-12
Yannakakis, Mihalis (2009), "Equilibria, fixed points, and complexity classes", Computer Science Review, 3 (2): 71–85, arXiv:0802.2831, doi:10.1016/j.cosrev.2009.03.004.
Childs, Andrew M.; Cleve, Richard; Deotto, Enrico; Farhi, Edward; Gutmann, Sam; Spielman, Daniel A. (2003), "Exponential algorithmic speedup by a quantum walk", Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, New York: ACM, pp. 59–68, arXiv:quant-ph/0209131, doi:10.1145/780542.780552, ISBN 1-58113-674-9, MR 2121062, S2CID 308884.
Kannan, Sampath; Naor, Moni; Rudich, Steven (1992), "Implicit representation of graphs", SIAM Journal on Discrete Mathematics, 5 (4): 596–603, doi:10.1137/0405049, MR 1186827.
Chrobak, Marek; Eppstein, David (1991), "Planar orientations with low out-degree and compaction of adjacency matrices" (PDF), Theoretical Computer Science, 86 (2): 243–266, doi:10.1016/0304-3975(91)90020-3.
Ma, Tze Heng; Spinrad, Jeremy P. (1991), "Cycle-free partial orders and chordal comparability graphs", Order, 8 (1): 49–61, doi:10.1007/BF00385814, MR 1129614, S2CID 120479154.
Curtis, Andrew R.; Izurieta, Clemente; Joeris, Benson; Lundberg, Scott; McConnell, Ross M. (2010), "An implicit representation of chordal comparability graphs in linear time", Discrete Applied Mathematics, 158 (8): 869–875, doi:10.1016/j.dam.2010.01.005, MR 2602811.
Hatami, Hamed; Hatami, Pooya (2022), "The implicit graph conjecture is false", 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022, Denver, CO, USA, October 31 – November 3, 2022, IEEE, pp. 1134–1137, arXiv:2111.13198, doi:10.1109/FOCS54457.2022.00109
Alstrup, Stephen; Rauhe, Theis (2002), "Small induced-universal graphs and compact implicit graph representations" (PDF), Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 53–62, doi:10.1109/SFCS.2002.1181882, ISBN 0-7695-1822-2, S2CID 1820524, archived from the original (PDF) on 2011-09-27, retrieved 2011-07-13.
Arnaud, Labourel; Gavoille, Cyril (2007), "Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs" (PDF), Proceedings of the 15th annual European Symposium on Algorithms, Lecture Notes in Computer Science, vol. 4698, pp. 582–593, doi:10.1007/978-3-540-75520-3_52, ISBN 978-3-540-75519-7.
Bonamy, Marthe; Gavoille, Cyril; Pilipczuk, Michał (2020), "Shorter Labeling Schemes for Planar Graphs", Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, pp. 446–462, arXiv:1908.03341, doi:10.1007/978-3-540-75520-3_52.
Dujmović, Vida; Esperet, Louis; Joret, Gwenaël; Gavoille, Cyril; Micek, Piotr; Morin, Pat (2020), "Adjacency Labelling for Planar Graphs (and Beyond)", 61st IEEE Annual Symposium on Foundations of Computer Science, pp. 577–588, arXiv:2003.04280, doi:10.1007/978-3-540-75520-3_52.
Rivest, Ronald L.; Vuillemin, Jean (1975), "A generalization and proof of the Aanderaa-Rosenberg conjecture", Proc. 7th ACM Symposium on Theory of Computing, Albuquerque, New Mexico, United States, pp. 6–11, CiteSeerX 10.1.1.309.7236, doi:10.1145/800116.803747, S2CID 16220596{{citation}}: CS1 maint: location missing publisher (link).
Kahn, Jeff; Saks, Michael; Sturtevant, Dean (1983), "A topological approach to evasiveness", Symposium on Foundations of Computer Science, Los Alamitos, CA, USA: IEEE Computer Society, pp. 31–33, doi:10.1109/SFCS.1983.4, ISBN 0-8186-0508-1.
Bender, Michael A.; Ron, Dana (2000), "Testing acyclicity of directed graphs in sublinear time", Automata, languages and programming (Geneva, 2000), Lecture Notes in Comput. Sci., vol. 1853, Berlin: Springer, pp. 809–820, doi:10.1007/3-540-45022-X_68, ISBN 978-3-540-67715-4, MR 1795937.

it-c.dk (Global: low place; English: low place)

Alstrup, Stephen; Rauhe, Theis (2002), "Small induced-universal graphs and compact implicit graph representations" (PDF), Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 53–62, doi:10.1109/SFCS.2002.1181882, ISBN 0-7695-1822-2, S2CID 1820524, archived from the original (PDF) on 2011-09-27, retrieved 2011-07-13.

labri.fr (Global: low place; English: low place)

dept-info.labri.fr

Arnaud, Labourel; Gavoille, Cyril (2007), "Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs" (PDF), Proceedings of the 15th annual European Symposium on Algorithms, Lecture Notes in Computer Science, vol. 4698, pp. 582–593, doi:10.1007/978-3-540-75520-3_52, ISBN 978-3-540-75519-7.

psu.edu (Global: 207^th place; English: 136^th place)

citeseerx.ist.psu.edu

Rivest, Ronald L.; Vuillemin, Jean (1975), "A generalization and proof of the Aanderaa-Rosenberg conjecture", Proc. 7th ACM Symposium on Theory of Computing, Albuquerque, New Mexico, United States, pp. 6–11, CiteSeerX 10.1.1.309.7236, doi:10.1145/800116.803747, S2CID 16220596{{citation}}: CS1 maint: location missing publisher (link).

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Korf, Richard E. (2008), "Linear-time disk-based implicit graph search", Journal of the ACM, 55 (6) 26: 1–40, doi:10.1145/1455248.1455250, MR 2477486, S2CID 13969607.
Childs, Andrew M.; Cleve, Richard; Deotto, Enrico; Farhi, Edward; Gutmann, Sam; Spielman, Daniel A. (2003), "Exponential algorithmic speedup by a quantum walk", Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, New York: ACM, pp. 59–68, arXiv:quant-ph/0209131, doi:10.1145/780542.780552, ISBN 1-58113-674-9, MR 2121062, S2CID 308884.
Ma, Tze Heng; Spinrad, Jeremy P. (1991), "Cycle-free partial orders and chordal comparability graphs", Order, 8 (1): 49–61, doi:10.1007/BF00385814, MR 1129614, S2CID 120479154.
Alstrup, Stephen; Rauhe, Theis (2002), "Small induced-universal graphs and compact implicit graph representations" (PDF), Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 53–62, doi:10.1109/SFCS.2002.1181882, ISBN 0-7695-1822-2, S2CID 1820524, archived from the original (PDF) on 2011-09-27, retrieved 2011-07-13.
Rivest, Ronald L.; Vuillemin, Jean (1975), "A generalization and proof of the Aanderaa-Rosenberg conjecture", Proc. 7th ACM Symposium on Theory of Computing, Albuquerque, New Mexico, United States, pp. 6–11, CiteSeerX 10.1.1.309.7236, doi:10.1145/800116.803747, S2CID 16220596{{citation}}: CS1 maint: location missing publisher (link).

uci.edu (Global: 3,063^rd place; English: 2,041^st place)

ics.uci.edu

Chrobak, Marek; Eppstein, David (1991), "Planar orientations with low out-degree and compaction of adjacency matrices" (PDF), Theoretical Computer Science, 86 (2): 243–266, doi:10.1016/0304-3975(91)90020-3.

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

Papadimitriou, Christos (1994), "On the complexity of the parity argument and other inefficient proofs of existence" (PDF), Journal of Computer and System Sciences, 48 (3): 498–532, doi:10.1016/S0022-0000(05)80063-7, archived from the original (PDF) on 2016-03-04, retrieved 2011-07-12
Kang, Ross J.; Müller, Tobias (2011), Sphere and dot product representations of graphs (PDF), archived from the original (PDF) on 2012-03-16, retrieved 2011-07-12.
Alstrup, Stephen; Rauhe, Theis (2002), "Small induced-universal graphs and compact implicit graph representations" (PDF), Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 53–62, doi:10.1109/SFCS.2002.1181882, ISBN 0-7695-1822-2, S2CID 1820524, archived from the original (PDF) on 2011-09-27, retrieved 2011-07-13.

Implicit graph (English Wikipedia)

aaai.org (Global: 9,352nd place; English: 5,696th place)

ams.org (Global: 451st place; English: 277th place)

mathscinet.ams.org

arxiv.org (Global: 69th place; English: 59th place)

berkeley.edu (Global: 580th place; English: 462nd place)

cs.berkeley.edu

books.google.com (Global: 3rd place; English: 3rd place)

cwi.nl (Global: low place; English: low place)

homepages.cwi.nl

doi.org (Global: 2nd place; English: 2nd place)

it-c.dk (Global: low place; English: low place)

labri.fr (Global: low place; English: low place)

dept-info.labri.fr

psu.edu (Global: 207th place; English: 136th place)

citeseerx.ist.psu.edu

semanticscholar.org (Global: 11th place; English: 8th place)

api.semanticscholar.org

uci.edu (Global: 3,063rd place; English: 2,041st place)

ics.uci.edu

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

aaai.org (Global: 9,352^nd place; English: 5,696^th place)

ams.org (Global: 451^st place; English: 277^th place)

arxiv.org (Global: 69^th place; English: 59^th place)

berkeley.edu (Global: 580^th place; English: 462^nd place)

books.google.com (Global: 3^rd place; English: 3^rd place)

doi.org (Global: 2^nd place; English: 2^nd place)

psu.edu (Global: 207^th place; English: 136^th place)

semanticscholar.org (Global: 11^th place; English: 8^th place)

uci.edu (Global: 3,063^rd place; English: 2,041^st place)

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