Treewidth (English Wikipedia)

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

refsWebsite

Global rank English rank

21doi.org

2^nd place

11ams.org

451^st place

277^th place

8semanticscholar.org

11^th place

8^th place

6psu.edu

207^th place

136^th place

5arxiv.org

69^th place

59^th place

2uni-hamburg.de

3,809^th place

5,200^th place

2books.google.com

3^rd place

2erikdemaine.org

low place

1aaai.org

9,352^nd place

5,696^th place

aaai.org

Dow & Korf (2007). Dow, P. Alex; Korf, Richard E. (2007), "Best-first search for treewidth", Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, July 22-26, 2007, Vancouver, British Columbia, Canada, AAAI Press, pp. 1146–1151

ams.org

mathscinet.ams.org

Arnborg, Proskurowski & Corneil (1990); Satyanarayana & Tung (1990). Arnborg, Stefan; Proskurowski, Andrzej; Corneil, Derek G. (1990), "Forbidden minors characterization of partial 3-trees", Discrete Mathematics, 80 (1): 1–19, doi:10.1016/0012-365X(90)90292-P, MR 1045920. Satyanarayana, A.; Tung, L. (1990), "A characterization of partial 3-trees", Networks, 20 (3): 299–322, doi:10.1002/net.3230200304, MR 1050503.
Ramachandramurthi (1997). Ramachandramurthi, Siddharthan (1997), "The structure and number of obstructions to treewidth", SIAM Journal on Discrete Mathematics, 10 (1): 146–157, doi:10.1137/S0895480195280010, MR 1430552.
Lagergren (1993). Lagergren, Jens (1993), "An upper bound on the size of an obstruction", Graph structure theory (Seattle, WA, 1991), Contemporary Mathematics, vol. 147, Providence, RI: American Mathematical Society, pp. 601–621, doi:10.1090/conm/147/01202, ISBN 9780821851609, MR 1224734.
Chekuri & Chuzhoy (2016) Chekuri, Chandra; Chuzhoy, Julia (2016), "Polynomial bounds for the grid-minor theorem", Journal of the ACM, 63 (5): A40:1–65, arXiv:1305.6577, doi:10.1145/2820609, MR 3593966, S2CID 209860422.
Diestel (2004). Diestel, Reinhard (2004), "A short proof of Halin's grid theorem", Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, 74: 237–242, doi:10.1007/BF02941538, MR 2112834, S2CID 124603912.
Eppstein (2000). Eppstein, D. (2000), "Diameter and treewidth in minor-closed graph families", Algorithmica, 27 (3–4): 275–291, arXiv:math/9907126, doi:10.1007/s004530010020, MR 1759751, S2CID 3172160.
Eppstein (2000); Demaine & Hajiaghayi (2004a). Eppstein, D. (2000), "Diameter and treewidth in minor-closed graph families", Algorithmica, 27 (3–4): 275–291, arXiv:math/9907126, doi:10.1007/s004530010020, MR 1759751, S2CID 3172160. Demaine, Erik D.; Hajiaghayi, MohammadTaghi (2004a), "Diameter and treewidth in minor-closed graph families, revisited", Algorithmica, 40 (3): 211–215, doi:10.1007/s00453-004-1106-1, MR 2080518, S2CID 390856.
Demaine & Hajiaghayi (2004b). Demaine, Erik D.; Hajiaghayi, MohammadTaghi (2004b), "Equivalence of local treewidth and linear local treewidth and its algorithmic applications", Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, New York: ACM, pp. 840–849, MR 2290974.
Demaine et al. (2004); Demaine & Hajiaghayi (2008). Demaine, Erik D.; Fomin, Fedor V.; Hajiaghayi, MohammadTaghi; Thilikos, Dimitrios M. (2004), "Bidimensional parameters and local treewidth", SIAM Journal on Discrete Mathematics, 18 (3): 501–511, CiteSeerX 10.1.1.107.6195, doi:10.1137/S0895480103433410, MR 2134412, S2CID 7803025. Demaine, Erik D.; Hajiaghayi, MohammadTaghi (2008), "Linearity of grid minors in treewidth with applications through bidimensionality" (PDF), Combinatorica, 28 (1): 19–36, doi:10.1007/s00493-008-2140-4, S2CID 16520181.
Frick & Grohe (2001). Frick, Markus; Grohe, Martin (2001), "Deciding first-order properties of locally tree-decomposable structures", Journal of the ACM, 48 (6): 1184–1206, arXiv:cs/0004007, doi:10.1145/504794.504798, MR 2143836, S2CID 999472.
Grigoriev & Bodlaender (2007). Grigoriev, Alexander; Bodlaender, Hans L. (2007), "Algorithms for graphs embeddable with few crossings per edge", Algorithmica, 49 (1): 1–11, CiteSeerX 10.1.1.65.5071, doi:10.1007/s00453-007-0010-x, MR 2344391, S2CID 8174422.

arxiv.org

Gogate & Dechter (2004). Gogate, Vibhav; Dechter, Rina (2004), "A complete anytime algorithm for treewidth", in Chickering, David Maxwell; Halpern, Joseph Y. (eds.), UAI '04, Proceedings of the 20th Conference in Uncertainty in Artificial Intelligence, Banff, Canada, July 7-11, 2004, AUAI Press, pp. 201–208, arXiv:1207.4109
Chekuri & Chuzhoy (2016) Chekuri, Chandra; Chuzhoy, Julia (2016), "Polynomial bounds for the grid-minor theorem", Journal of the ACM, 63 (5): A40:1–65, arXiv:1305.6577, doi:10.1145/2820609, MR 3593966, S2CID 209860422.
Eppstein (2000). Eppstein, D. (2000), "Diameter and treewidth in minor-closed graph families", Algorithmica, 27 (3–4): 275–291, arXiv:math/9907126, doi:10.1007/s004530010020, MR 1759751, S2CID 3172160.
Eppstein (2000); Demaine & Hajiaghayi (2004a). Eppstein, D. (2000), "Diameter and treewidth in minor-closed graph families", Algorithmica, 27 (3–4): 275–291, arXiv:math/9907126, doi:10.1007/s004530010020, MR 1759751, S2CID 3172160. Demaine, Erik D.; Hajiaghayi, MohammadTaghi (2004a), "Diameter and treewidth in minor-closed graph families, revisited", Algorithmica, 40 (3): 211–215, doi:10.1007/s00453-004-1106-1, MR 2080518, S2CID 390856.
Frick & Grohe (2001). Frick, Markus; Grohe, Martin (2001), "Deciding first-order properties of locally tree-decomposable structures", Journal of the ACM, 48 (6): 1184–1206, arXiv:cs/0004007, doi:10.1145/504794.504798, MR 2143836, S2CID 999472.

books.google.com

Kao (2008). Kao, Ming-Yang, ed. (2008), "Treewidth of graphs", Encyclopedia of Algorithms, Springer, p. 969, ISBN 9780387307701, Another long-standing open problem is whether there is a polynomial-time algorithm to compute the treewidth of planar graphs.
Bertelè & Brioschi (1972). Bertelè, Umberto; Brioschi, Francesco (1972), Nonserial Dynamic Programming, Academic Press, pp. 37–38, ISBN 978-0-12-093450-8.

doi.org

Bodlaender (1988). Bodlaender, Hans L. (1988), "Dynamic programming on graphs with bounded treewidth", Proc. 15th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 317, Springer-Verlag, pp. 105–118, CiteSeerX 10.1.1.18.8503, doi:10.1007/3-540-19488-6_110, ISBN 978-3-540-19488-0.
Seymour & Thomas (1993). Seymour, Paul D.; Thomas, Robin (1993), "Graph searching and a min-max theorem for tree-width", Journal of Combinatorial Theory, Series B, 58 (1): 22–33, doi:10.1006/jctb.1993.1027.
Bodlaender (1998). Bodlaender, Hans L. (1998), "A partial k-arboretum of graphs with bounded treewidth", Theoretical Computer Science, 209 (1–2): 1–45, doi:10.1016/S0304-3975(97)00228-4.
Thorup (1998). Thorup, Mikkel (1998), "All structured programs have small tree width and good register allocation", Information and Computation, 142 (2): 159–181, doi:10.1006/inco.1997.2697.
Robertson & Seymour (1986). Robertson, Neil; Seymour, Paul D. (1986), "Graph minors V: Excluding a planar graph", Journal of Combinatorial Theory, Series B, 41 (1): 92–114, doi:10.1016/0095-8956(86)90030-4.
Arnborg, Proskurowski & Corneil (1990); Satyanarayana & Tung (1990). Arnborg, Stefan; Proskurowski, Andrzej; Corneil, Derek G. (1990), "Forbidden minors characterization of partial 3-trees", Discrete Mathematics, 80 (1): 1–19, doi:10.1016/0012-365X(90)90292-P, MR 1045920. Satyanarayana, A.; Tung, L. (1990), "A characterization of partial 3-trees", Networks, 20 (3): 299–322, doi:10.1002/net.3230200304, MR 1050503.
Ramachandramurthi (1997). Ramachandramurthi, Siddharthan (1997), "The structure and number of obstructions to treewidth", SIAM Journal on Discrete Mathematics, 10 (1): 146–157, doi:10.1137/S0895480195280010, MR 1430552.
Lagergren (1993). Lagergren, Jens (1993), "An upper bound on the size of an obstruction", Graph structure theory (Seattle, WA, 1991), Contemporary Mathematics, vol. 147, Providence, RI: American Mathematical Society, pp. 601–621, doi:10.1090/conm/147/01202, ISBN 9780821851609, MR 1224734.
Arnborg, Corneil & Proskurowski (1987). Arnborg, S.; Corneil, D.; Proskurowski, A. (1987), "Complexity of finding embeddings in a $k$ -tree", SIAM Journal on Matrix Analysis and Applications, 8 (2): 277–284, doi:10.1137/0608024.
Bodlaender (1996). Bodlaender, Hans L. (1996), "A linear time algorithm for finding tree-decompositions of small treewidth", SIAM Journal on Computing, 25 (6): 1305–1317, CiteSeerX 10.1.1.19.7484, doi:10.1137/S0097539793251219.
Arnborg & Proskurowski (1989); Bern, Lawler & Wong (1987); Bodlaender (1988). Arnborg, S.; Proskurowski, A. (1989), "Linear time algorithms for NP-hard problems restricted to partial $k$ -trees", Discrete Applied Mathematics, 23 (1): 11–24, doi:10.1016/0166-218X(89)90031-0. Bern, M. W.; Lawler, E. L.; Wong, A. L. (1987), "Linear-time computation of optimal subgraphs of decomposable graphs", Journal of Algorithms, 8 (2): 216–235, doi:10.1016/0196-6774(87)90039-3. Bodlaender, Hans L. (1988), "Dynamic programming on graphs with bounded treewidth", Proc. 15th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 317, Springer-Verlag, pp. 105–118, CiteSeerX 10.1.1.18.8503, doi:10.1007/3-540-19488-6_110, ISBN 978-3-540-19488-0.
Courcelle (1990); Courcelle (1992) Courcelle, B. (1990), "The monadic second-order logic of graphs I: Recognizable sets of finite graphs", Information and Computation, 85: 12–75, CiteSeerX 10.1.1.158.5595, doi:10.1016/0890-5401(90)90043-h. Courcelle, B. (1992), "The monadic second-order logic of graphs III: Treewidth, forbidden minors and complexity issues.", Informatique Théorique (26): 257–286.
Robertson & Seymour (1986). Robertson, Neil; Seymour, Paul D. (1986), "Graph minors V: Excluding a planar graph", Journal of Combinatorial Theory, Series B, 41 (1): 92–114, doi:10.1016/0095-8956(86)90030-4.
Chekuri & Chuzhoy (2016) Chekuri, Chandra; Chuzhoy, Julia (2016), "Polynomial bounds for the grid-minor theorem", Journal of the ACM, 63 (5): A40:1–65, arXiv:1305.6577, doi:10.1145/2820609, MR 3593966, S2CID 209860422.
Demaine & Hajiaghayi (2008). Demaine, Erik D.; Hajiaghayi, MohammadTaghi (2008), "Linearity of grid minors in treewidth with applications through bidimensionality" (PDF), Combinatorica, 28 (1): 19–36, doi:10.1007/s00493-008-2140-4, S2CID 16520181.
Diestel (2004). Diestel, Reinhard (2004), "A short proof of Halin's grid theorem", Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, 74: 237–242, doi:10.1007/BF02941538, MR 2112834, S2CID 124603912.
Eppstein (2000). Eppstein, D. (2000), "Diameter and treewidth in minor-closed graph families", Algorithmica, 27 (3–4): 275–291, arXiv:math/9907126, doi:10.1007/s004530010020, MR 1759751, S2CID 3172160.
Eppstein (2000); Demaine & Hajiaghayi (2004a). Eppstein, D. (2000), "Diameter and treewidth in minor-closed graph families", Algorithmica, 27 (3–4): 275–291, arXiv:math/9907126, doi:10.1007/s004530010020, MR 1759751, S2CID 3172160. Demaine, Erik D.; Hajiaghayi, MohammadTaghi (2004a), "Diameter and treewidth in minor-closed graph families, revisited", Algorithmica, 40 (3): 211–215, doi:10.1007/s00453-004-1106-1, MR 2080518, S2CID 390856.
Demaine et al. (2004); Demaine & Hajiaghayi (2008). Demaine, Erik D.; Fomin, Fedor V.; Hajiaghayi, MohammadTaghi; Thilikos, Dimitrios M. (2004), "Bidimensional parameters and local treewidth", SIAM Journal on Discrete Mathematics, 18 (3): 501–511, CiteSeerX 10.1.1.107.6195, doi:10.1137/S0895480103433410, MR 2134412, S2CID 7803025. Demaine, Erik D.; Hajiaghayi, MohammadTaghi (2008), "Linearity of grid minors in treewidth with applications through bidimensionality" (PDF), Combinatorica, 28 (1): 19–36, doi:10.1007/s00493-008-2140-4, S2CID 16520181.
Frick & Grohe (2001). Frick, Markus; Grohe, Martin (2001), "Deciding first-order properties of locally tree-decomposable structures", Journal of the ACM, 48 (6): 1184–1206, arXiv:cs/0004007, doi:10.1145/504794.504798, MR 2143836, S2CID 999472.
Grigoriev & Bodlaender (2007). Grigoriev, Alexander; Bodlaender, Hans L. (2007), "Algorithms for graphs embeddable with few crossings per edge", Algorithmica, 49 (1): 1–11, CiteSeerX 10.1.1.65.5071, doi:10.1007/s00453-007-0010-x, MR 2344391, S2CID 8174422.

erikdemaine.org

Demaine & Hajiaghayi (2008). Demaine, Erik D.; Hajiaghayi, MohammadTaghi (2008), "Linearity of grid minors in treewidth with applications through bidimensionality" (PDF), Combinatorica, 28 (1): 19–36, doi:10.1007/s00493-008-2140-4, S2CID 16520181.
Demaine et al. (2004); Demaine & Hajiaghayi (2008). Demaine, Erik D.; Fomin, Fedor V.; Hajiaghayi, MohammadTaghi; Thilikos, Dimitrios M. (2004), "Bidimensional parameters and local treewidth", SIAM Journal on Discrete Mathematics, 18 (3): 501–511, CiteSeerX 10.1.1.107.6195, doi:10.1137/S0895480103433410, MR 2134412, S2CID 7803025. Demaine, Erik D.; Hajiaghayi, MohammadTaghi (2008), "Linearity of grid minors in treewidth with applications through bidimensionality" (PDF), Combinatorica, 28 (1): 19–36, doi:10.1007/s00493-008-2140-4, S2CID 16520181.

psu.edu

citeseerx.ist.psu.edu

Bodlaender (1988). Bodlaender, Hans L. (1988), "Dynamic programming on graphs with bounded treewidth", Proc. 15th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 317, Springer-Verlag, pp. 105–118, CiteSeerX 10.1.1.18.8503, doi:10.1007/3-540-19488-6_110, ISBN 978-3-540-19488-0.
Bodlaender (1996). Bodlaender, Hans L. (1996), "A linear time algorithm for finding tree-decompositions of small treewidth", SIAM Journal on Computing, 25 (6): 1305–1317, CiteSeerX 10.1.1.19.7484, doi:10.1137/S0097539793251219.
Arnborg & Proskurowski (1989); Bern, Lawler & Wong (1987); Bodlaender (1988). Arnborg, S.; Proskurowski, A. (1989), "Linear time algorithms for NP-hard problems restricted to partial $k$ -trees", Discrete Applied Mathematics, 23 (1): 11–24, doi:10.1016/0166-218X(89)90031-0. Bern, M. W.; Lawler, E. L.; Wong, A. L. (1987), "Linear-time computation of optimal subgraphs of decomposable graphs", Journal of Algorithms, 8 (2): 216–235, doi:10.1016/0196-6774(87)90039-3. Bodlaender, Hans L. (1988), "Dynamic programming on graphs with bounded treewidth", Proc. 15th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 317, Springer-Verlag, pp. 105–118, CiteSeerX 10.1.1.18.8503, doi:10.1007/3-540-19488-6_110, ISBN 978-3-540-19488-0.
Courcelle (1990); Courcelle (1992) Courcelle, B. (1990), "The monadic second-order logic of graphs I: Recognizable sets of finite graphs", Information and Computation, 85: 12–75, CiteSeerX 10.1.1.158.5595, doi:10.1016/0890-5401(90)90043-h. Courcelle, B. (1992), "The monadic second-order logic of graphs III: Treewidth, forbidden minors and complexity issues.", Informatique Théorique (26): 257–286.
Demaine et al. (2004); Demaine & Hajiaghayi (2008). Demaine, Erik D.; Fomin, Fedor V.; Hajiaghayi, MohammadTaghi; Thilikos, Dimitrios M. (2004), "Bidimensional parameters and local treewidth", SIAM Journal on Discrete Mathematics, 18 (3): 501–511, CiteSeerX 10.1.1.107.6195, doi:10.1137/S0895480103433410, MR 2134412, S2CID 7803025. Demaine, Erik D.; Hajiaghayi, MohammadTaghi (2008), "Linearity of grid minors in treewidth with applications through bidimensionality" (PDF), Combinatorica, 28 (1): 19–36, doi:10.1007/s00493-008-2140-4, S2CID 16520181.
Grigoriev & Bodlaender (2007). Grigoriev, Alexander; Bodlaender, Hans L. (2007), "Algorithms for graphs embeddable with few crossings per edge", Algorithmica, 49 (1): 1–11, CiteSeerX 10.1.1.65.5071, doi:10.1007/s00453-007-0010-x, MR 2344391, S2CID 8174422.

semanticscholar.org

api.semanticscholar.org

Chekuri & Chuzhoy (2016) Chekuri, Chandra; Chuzhoy, Julia (2016), "Polynomial bounds for the grid-minor theorem", Journal of the ACM, 63 (5): A40:1–65, arXiv:1305.6577, doi:10.1145/2820609, MR 3593966, S2CID 209860422.
Demaine & Hajiaghayi (2008). Demaine, Erik D.; Hajiaghayi, MohammadTaghi (2008), "Linearity of grid minors in treewidth with applications through bidimensionality" (PDF), Combinatorica, 28 (1): 19–36, doi:10.1007/s00493-008-2140-4, S2CID 16520181.
Diestel (2004). Diestel, Reinhard (2004), "A short proof of Halin's grid theorem", Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, 74: 237–242, doi:10.1007/BF02941538, MR 2112834, S2CID 124603912.
Eppstein (2000). Eppstein, D. (2000), "Diameter and treewidth in minor-closed graph families", Algorithmica, 27 (3–4): 275–291, arXiv:math/9907126, doi:10.1007/s004530010020, MR 1759751, S2CID 3172160.
Eppstein (2000); Demaine & Hajiaghayi (2004a). Eppstein, D. (2000), "Diameter and treewidth in minor-closed graph families", Algorithmica, 27 (3–4): 275–291, arXiv:math/9907126, doi:10.1007/s004530010020, MR 1759751, S2CID 3172160. Demaine, Erik D.; Hajiaghayi, MohammadTaghi (2004a), "Diameter and treewidth in minor-closed graph families, revisited", Algorithmica, 40 (3): 211–215, doi:10.1007/s00453-004-1106-1, MR 2080518, S2CID 390856.
Demaine et al. (2004); Demaine & Hajiaghayi (2008). Demaine, Erik D.; Fomin, Fedor V.; Hajiaghayi, MohammadTaghi; Thilikos, Dimitrios M. (2004), "Bidimensional parameters and local treewidth", SIAM Journal on Discrete Mathematics, 18 (3): 501–511, CiteSeerX 10.1.1.107.6195, doi:10.1137/S0895480103433410, MR 2134412, S2CID 7803025. Demaine, Erik D.; Hajiaghayi, MohammadTaghi (2008), "Linearity of grid minors in treewidth with applications through bidimensionality" (PDF), Combinatorica, 28 (1): 19–36, doi:10.1007/s00493-008-2140-4, S2CID 16520181.
Frick & Grohe (2001). Frick, Markus; Grohe, Martin (2001), "Deciding first-order properties of locally tree-decomposable structures", Journal of the ACM, 48 (6): 1184–1206, arXiv:cs/0004007, doi:10.1145/504794.504798, MR 2143836, S2CID 999472.
Grigoriev & Bodlaender (2007). Grigoriev, Alexander; Bodlaender, Hans L. (2007), "Algorithms for graphs embeddable with few crossings per edge", Algorithmica, 49 (1): 1–11, CiteSeerX 10.1.1.65.5071, doi:10.1007/s00453-007-0010-x, MR 2344391, S2CID 8174422.

uni-hamburg.de

math.uni-hamburg.de

Diestel (2005) pp.354–355 Diestel, Reinhard (2005), Graph Theory (3rd ed.), Springer, ISBN 978-3-540-26182-7
Diestel (2005) section 12.3 Diestel, Reinhard (2005), Graph Theory (3rd ed.), Springer, ISBN 978-3-540-26182-7