径宽 (Chinese Wikipedia)

Analysis of information sources in references of the Wikipedia article "径宽" in Chinese language version.

refsWebsite

Global rank Chinese rank

51doi.org

2^nd place

23^rd place

14semanticscholar.org

11^th place

332^nd place

8handle.net

102^nd place

492^nd place

7web.archive.org

1^st place

2inria.fr

4,903^rd place

7,274^th place

1springerlink.com

2,569^th place

1,358^th place

1emis.de

low place

1arxiv.org

69^th place

254^th place

1harvard.edu

18^th place

57^th place

1mcgill.ca

2,527^th place

3,325^th place

1carleton.ca

9,843^rd place

low place

1uib.no

4,170^th place

8,969^th place

1musanim.com

low place

1nih.gov

4^th place

5^th place

arxiv.org

Bienstock et al. (1991); Diestel (1995); Cattell, Dinneen & Fellows (1996). Bienstock, Dan; Robertson, Neil; Seymour, Paul; Thomas, Robin, Quickly excluding a forest, Journal of Combinatorial Theory, Series B, 1991, 52 (2): 274–283, doi:10.1016/0095-8956(91)90068-U  . Diestel, Reinhard, Graph Minors I: a short proof of the path-width theorem, Combinatorics, Probability and Computing, 1995, 4 (1): 27–30, doi:10.1017/S0963548300001450 . Cattell, Kevin; Dinneen, Michael J.; Fellows, Michael R., A simple linear-time algorithm for finding path-decompositions of small width, Information Processing Letters, 1996, 57 (4): 197–203, S2CID 2442557, arXiv:math/9410211 , doi:10.1016/0020-0190(95)00190-5 .

carleton.ca

cg.scs.carleton.ca

Dujmović, Morin & Wood (2003). Dujmović, Vida; Morin, Pat; Wood, David R., Path-width and three-dimensional straight-line grid drawings of graphs (PDF), Proc. 10th International Symposium on Graph Drawing (GD 2002), Lecture Notes in Computer Science 2528, Springer-Verlag: 42–53, 2003 [2024-01-31], （原始内容存档 (PDF)于2012-03-04） .

doi.org

Diestel & Kühn (2005). Diestel, Reinhard; Kühn, Daniela, Graph minor hierarchies, Discrete Applied Mathematics, 2005, 145 (2): 167–182, doi:10.1016/j.dam.2004.01.010  .
Robertson & Seymour (1983). Robertson, Neil; Seymour, Paul, Graph minors. I. Excluding a forest, Journal of Combinatorial Theory, Series B, 1983, 35 (1): 39–61, doi:10.1016/0095-8956(83)90079-5  .
Bodlaender (1998). Bodlaender, Hans L., A partial k-arboretum of graphs with bounded treewidth, Theoretical Computer Science, 1998, 209 (1–2): 1–45, doi:10.1016/S0304-3975(97)00228-4  .
Robertson & Seymour (2003). Robertson, Neil; Seymour, Paul, Graph minors. XVI. Excluding a non-planar graph, Journal of Combinatorial Theory, Series B, 2003, 89 (1): 43–76, doi:10.1016/S0095-8956(03)00042-X  .
Kashiwabara & Fujisawa (1979); Ohtsuki et al. (1979); Lengauer (1981); Arnborg, Corneil & Proskurowski (1987). Kashiwabara, T.; Fujisawa, T., NP-completeness of the problem of finding a minimum-clique-number interval graph containing a given graph as a subgraph, Proc. International Symposium on Circuits and Systems: 657–660, 1979 . Ohtsuki, Tatsuo; Mori, Hajimu; Kuh, Ernest S.; Kashiwabara, Toshinobu; Fujisawa, Toshio, One-dimensional logic gate assignment and interval graphs, IEEE Transactions on Circuits and Systems, 1979, 26 (9): 675–684, doi:10.1109/TCS.1979.1084695 . Lengauer, Thomas, Black-white pebbles and graph separation, Acta Informatica, 1981, 16 (4): 465–475, S2CID 19415148, doi:10.1007/BF00264496 . Arnborg, Stefan; Corneil, Derek G.; Proskurowski, Andrzej, Complexity of finding embeddings in a $k$ -tree, SIAM Journal on Algebraic and Discrete Methods, 1987, 8 (2): 277–284, doi:10.1137/0608024 .
Bodlaender et al. (1992). Bodlaender, Hans L.; Gilbert, John R.; Hafsteinsson, Hjálmtýr; Kloks, Ton, Approximating treewidth, pathwidth, and minimum elimination tree height, Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science 570: 1–12, 1992, ISBN 978-3-540-55121-8, doi:10.1007/3-540-55121-2_1, hdl:1874/17927  .
Bodlaender (1996); Bodlaender & Kloks (1996) Bodlaender, Hans L., A linear-time algorithm for finding tree-decompositions of small treewidth, SIAM Journal on Computing, 1996, 25 (6): 1305–1317, doi:10.1137/S0097539793251219, hdl:1874/16670  . Bodlaender, Hans L.; Kloks, Ton, Efficient and constructive algorithms for the pathwidth and treewidth of graphs, Journal of Algorithms, 1996, 21 (2): 358–402, doi:10.1006/jagm.1996.0049, hdl:1874/16538  .
Möhring (1990); Scheffler (1990); Ellis, Sudborough & Turner (1994); Peng et al. (1998); Skodinis (2000); Skodinis (2003); Coudert, Huc & Mazauric (2012). Möhring, Rolf H., Graph problems related to gate matrix layout and PLA folding, Tinhofer, G.; Mayr, E.; Noltemeier, H.; et al (编), Computational Graph Theory, Computing Supplementum 7, Springer-Verlag: 17–51, 1990, ISBN 3-211-82177-5 . Scheffler, Petra, A linear algorithm for the pathwidth of trees, Bodendiek, R.; Henn, R. (编), Topics in Combinatorics and Graph Theory, Physica-Verlag: 613–620, 1990 . Ellis, J. A.; Sudborough, I. H.; Turner, J. S., The vertex separation and search number of a tree, Information and Computation, 1994, 113 (1): 50–79, doi:10.1006/inco.1994.1064  . Peng, Sheng-Lung; Ho, Chin-Wen; Hsu, Tsan-sheng; Ko, Ming-Tat; Tang, Chuan Yi, A linear-time algorithm for constructing an optimal node-search strategy of a tree, Proc. 4th Int. Conf. Computing and Combinatorics (COCOON'98), Lecture Notes in Computer Science 1449, Springer-Verlag: 197–205, 1998 ^{[失效連結]}. Skodinis, Konstantin, Computing optimal linear layouts of trees in linear time, Proc. 8th European Symposium on Algorithms (ESA 2000), Lecture Notes in Computer Science 1879, Springer-Verlag: 403–414, 2000, ISBN 978-3-540-41004-1, doi:10.1007/3-540-45253-2_37 . Skodinis, Konstantin, Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time, Journal of Algorithms, 2003, 47 (1): 40–59, doi:10.1016/S0196-6774(02)00225-0 . Coudert, David; Huc, Florian; Mazauric, Dorian, A Distributed Algorithm for Computing the Node Search Number in Trees (PDF), Algorithmica, 2012, 63 (1): 158–190 [2024-01-31], doi:10.1007/s00453-011-9524-3, （原始内容存档 (PDF)于2022-01-03） .
Arnborg (1985). Arnborg, Stefan, Efficient algorithms for combinatorial problems on graphs with bounded decomposability – A survey, BIT, 1985, 25 (1): 2–23, S2CID 122263659, doi:10.1007/BF01934985 .
Aspvall, Proskurowski & Telle (2000). Aspvall, Bengt; Proskurowski, Andrzej; Telle, Jan Arne, Memory requirements for table computations in partial k-tree algorithms, Algorithmica, 2000, 27 (3): 382–394, S2CID 9690525, doi:10.1007/s004530010025 .
Bodlaender (1998), Theorem 29, p. 13. Bodlaender, Hans L., A partial k-arboretum of graphs with bounded treewidth, Theoretical Computer Science, 1998, 209 (1–2): 1–45, doi:10.1016/S0304-3975(97)00228-4  .
Kinnersley (1992); Bodlaender (1998), Theorem 51. Kinnersley, Nancy G., The vertex separation number of a graph equals its path-width, Information Processing Letters, 1992, 42 (6): 345–350, doi:10.1016/0020-0190(92)90234-M  . Bodlaender, Hans L., A partial k-arboretum of graphs with bounded treewidth, Theoretical Computer Science, 1998, 209 (1–2): 1–45, doi:10.1016/S0304-3975(97)00228-4  .
Korach & Solel (1993), Lemma 3 p.99; Bodlaender (1998), Theorem 47, p. 24. Korach, Ephraim; Solel, Nir, Tree-width, path-width, and cutwidth, Discrete Applied Mathematics, 1993, 43 (1): 97–101, doi:10.1016/0166-218X(93)90171-J  . Bodlaender, Hans L., A partial k-arboretum of graphs with bounded treewidth, Theoretical Computer Science, 1998, 209 (1–2): 1–45, doi:10.1016/S0304-3975(97)00228-4  .
Korach & Solel (1993), Lemma 1, p. 99; Bodlaender (1998), Theorem 49, p. 24. Korach, Ephraim; Solel, Nir, Tree-width, path-width, and cutwidth, Discrete Applied Mathematics, 1993, 43 (1): 97–101, doi:10.1016/0166-218X(93)90171-J  . Bodlaender, Hans L., A partial k-arboretum of graphs with bounded treewidth, Theoretical Computer Science, 1998, 209 (1–2): 1–45, doi:10.1016/S0304-3975(97)00228-4  .
Korach & Solel (1993), Theorem 5, p. 99; Bodlaender (1998), Theorem 66, p. 30. Scheffler (1992)为n顶点森林的径宽提供了更紧的上界： $\log _{3}(2n+1)$ 。 Korach, Ephraim; Solel, Nir, Tree-width, path-width, and cutwidth, Discrete Applied Mathematics, 1993, 43 (1): 97–101, doi:10.1016/0166-218X(93)90171-J  . Bodlaender, Hans L., A partial k-arboretum of graphs with bounded treewidth, Theoretical Computer Science, 1998, 209 (1–2): 1–45, doi:10.1016/S0304-3975(97)00228-4  . Scheffler, Petra, Optimal embedding of a tree into an interval graph in linear time, Nešetřil, Jaroslav; Fiedler, Miroslav (编), Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity, Elsevier, 1992 .
Korach & Solel (1993), Theorem 6, p. 100; Bodlaender (1998), Corollary 24, p.10. Korach, Ephraim; Solel, Nir, Tree-width, path-width, and cutwidth, Discrete Applied Mathematics, 1993, 43 (1): 97–101, doi:10.1016/0166-218X(93)90171-J  . Bodlaender, Hans L., A partial k-arboretum of graphs with bounded treewidth, Theoretical Computer Science, 1998, 209 (1–2): 1–45, doi:10.1016/S0304-3975(97)00228-4  .
Gurski & Wanke (2007). Gurski, Frank; Wanke, Egon, Line graphs of bounded clique-width, Discrete Mathematics, 2007, 307 (22): 2734–2754, doi:10.1016/j.disc.2007.01.020  .
Golovach (1993). Golovach, P. A., The cutwidth of a graph and the vertex separation number of the line graph, Discrete Mathematics and Applications, 1993, 3 (5): 517–522, S2CID 120745961, doi:10.1515/dma.1993.3.5.517 .
Bodlaender (1998), Corollary 23, p. 10. Bodlaender, Hans L., A partial k-arboretum of graphs with bounded treewidth, Theoretical Computer Science, 1998, 209 (1–2): 1–45, doi:10.1016/S0304-3975(97)00228-4  .
Bodlaender (1998), Theorem 20, p. 9. Bodlaender, Hans L., A partial k-arboretum of graphs with bounded treewidth, Theoretical Computer Science, 1998, 209 (1–2): 1–45, doi:10.1016/S0304-3975(97)00228-4  .
Alon, Seymour & Thomas (1990). Alon, Noga; Seymour, Paul; Thomas, Robin, A separator theorem for graphs with an excluded minor and its applications, Proc. 22nd ACM Symp. on Theory of Computing (STOC 1990): 293–299, 1990, ISBN 0897913612, S2CID 17521329, doi:10.1145/100216.100254  .
Bodlaender & Fomin (2002); Coudert, Huc & Sereni (2007). Bodlaender, Hans L.; Fomin, Fedor V., Approximation of pathwidth of outerplanar graphs, Journal of Algorithms, 2002, 43 (2): 190–200, doi:10.1016/S0196-6774(02)00001-9 . Coudert, David; Huc, Florian; Sereni, Jean-Sébastien, Pathwidth of outerplanar graphs (PDF), Journal of Graph Theory, 2007, 55 (1): 27–41 [2024-01-31], doi:10.1002/jgt.20218, （原始内容存档 (PDF)于2022-01-03） .
Fomin & Thilikos (2007); Amini, Huc & Pérennes (2009). Fomin, Fedor V.; Thilikos, Dimitrios M., On self duality of pathwidth in polyhedral graph embeddings, Journal of Graph Theory, 2007, 55 (1): 42–54, doi:10.1002/jgt.20219 . Amini, Omid; Huc, Florian; Pérennes, Stéphane, On the path-width of planar graphs, SIAM Journal on Discrete Mathematics, 2009, 23 (3): 1311–1316, doi:10.1137/060670146 .
Fomin (2003). Fomin, Fedor V., Pathwidth of planar and line graphs, Graphs and Combinatorics, 2003, 19 (1): 91–99, S2CID 43123449, doi:10.1007/s00373-002-0490-z .
Bodlaender & Möhring (1990). Bodlaender, Hans L.; Möhring, Rolf H., The pathwidth and treewidth of cographs, Proc. 2nd Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science 447, Springer-Verlag: 301–309, 1990, ISBN 978-3-540-52846-3, doi:10.1007/3-540-52846-6_99, hdl:1874/16625  .
Bodlaender, Kloks & Kratsch (1993). Bodlaender, Hans L.; Kloks, Ton; Kratsch, Dieter, Treewidth and pathwidth of permutation graphs, Proc. 20th International Colloquium on Automata, Languages and Programming (ICALP 1993), Lecture Notes in Computer Science 700, Springer-Verlag: 114–125, 1993, ISBN 978-3-540-56939-8, doi:10.1007/3-540-56939-1_66, hdl:1874/16657  .
Habib & Möhring (1994). Habib, Michel; Möhring, Rolf H., Treewidth of cocomparability graphs and a new order-theoretic parameter, Order, 1994, 11 (1): 47–60, S2CID 2648030, doi:10.1007/BF01462229 .
Garbe (1995). Garbe, Renate, Tree-width and path-width of comparability graphs of interval orders, Proc. 20th International Workshop Graph-Theoretic Concepts in Computer Science (WG'94), Lecture Notes in Computer Science 903, Springer-Verlag: 26–37, 1995, ISBN 978-3-540-59071-2, doi:10.1007/3-540-59071-4_35 .
Fomin & Høie (2006). Fomin, Fedor V.; Høie, Kjartan, Pathwidth of cubic graphs and exact algorithms, Information Processing Letters, 2006, 97 (5): 191–196, doi:10.1016/j.ipl.2005.10.012 .
Fomin et al. (2008). Fomin, Fedor V.; Kratsch, Dieter; Todinca, Ioan; Villanger, Yngve, Exact algorithms for treewidth and minimum fill-in, SIAM Journal on Computing, 2008, 38 (3): 1058–1079, doi:10.1137/050643350, hdl:1956/1151  .
Monien & Sudborough (1988). Monien, B.; Sudborough, I. H., Min cut is NP-complete for edge weighted trees, Theoretical Computer Science, 1988, 58 (1–3): 209–229, doi:10.1016/0304-3975(88)90028-X  .
Gustedt (1993). Gustedt, Jens, On the pathwidth of chordal graphs, Discrete Applied Mathematics, 1993, 45 (3): 233–248, doi:10.1016/0166-218X(93)90012-D  .
Kloks, Kratsch & Müller (1995). 弦多米诺是顶点都属于至多2个最大团的弦图。 Kloks, Ton; Kratsch, Dieter; Müller, H., Dominoes, Proc. 20th International Workshop Graph-Theoretic Concepts in Computer Science (WG'94), Lecture Notes in Computer Science 903, Springer-Verlag: 106–120, 1995, ISBN 978-3-540-59071-2, doi:10.1007/3-540-59071-4_41 .
Kloks et al. (1993). Kloks, T.; Bodlaender, H.; Müller, H.; Kratsch, D., Computing treewidth and minimum fill-in: all you need are the minimal separators, Proc. 1st European Symposium on Algorithms (ESA'93) (Lecture Notes in Computer Science) 726, Springer-Verlag: 260–271, 1993, doi:10.1007/3-540-57273-2_61 .
Kloks & Bodlaender (1992); Gustedt (1993). Kloks, Ton; Bodlaender, Hans L., Approximating treewidth and pathwidth of some classes of perfect graphs, Proc. 3rd International Symposium on Algorithms and Computation (ISAAC'92), Lecture Notes in Computer Science 650, Springer-Verlag: 116–125, 1992, ISBN 978-3-540-56279-5, doi:10.1007/3-540-56279-6_64, hdl:1874/16672  . Gustedt, Jens, On the pathwidth of chordal graphs, Discrete Applied Mathematics, 1993, 45 (3): 233–248, doi:10.1016/0166-218X(93)90012-D  .
Garbe (1995)将此成果归功于Ton Kloks的博士论文（1993）；Garbe对区间序的可比图的多项式时间算法推广了结果，而弦图属于此类可比图。 Garbe, Renate, Tree-width and path-width of comparability graphs of interval orders, Proc. 20th International Workshop Graph-Theoretic Concepts in Computer Science (WG'94), Lecture Notes in Computer Science 903, Springer-Verlag: 26–37, 1995, ISBN 978-3-540-59071-2, doi:10.1007/3-540-59071-4_35 .
Suchan & Todinca (2007). Suchan, Karol; Todinca, Ioan, Pathwidth of circular-arc graphs, Proc. 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2007), Lecture Notes in Computer Science 4769, Springer-Verlag: 258–269, 2007, doi:10.1007/978-3-540-74839-7_25 .
Feige, Hajiaghayi & Lee (2005). Feige, Uriel; Hajiaghayi, Mohammadtaghi; Lee, James R., Improved approximation algorithms for minimum-weight vertex separators, Proc. 37th ACM Symposium on Theory of Computing (STOC 2005): 563–572, 2005, ISBN 1581139608, S2CID 14097859, doi:10.1145/1060590.1060674 .
Robertson & Seymour (2004). Robertson, Neil; Seymour, Paul D., Graph Minors. XX. Wagner's conjecture, Journal of Combinatorial Theory, Series B, 2004, 92 (2): 325–357, doi:10.1016/j.jctb.2004.08.001  .
Bienstock et al. (1991); Diestel (1995); Cattell, Dinneen & Fellows (1996). Bienstock, Dan; Robertson, Neil; Seymour, Paul; Thomas, Robin, Quickly excluding a forest, Journal of Combinatorial Theory, Series B, 1991, 52 (2): 274–283, doi:10.1016/0095-8956(91)90068-U  . Diestel, Reinhard, Graph Minors I: a short proof of the path-width theorem, Combinatorics, Probability and Computing, 1995, 4 (1): 27–30, doi:10.1017/S0963548300001450 . Cattell, Kevin; Dinneen, Michael J.; Fellows, Michael R., A simple linear-time algorithm for finding path-decompositions of small width, Information Processing Letters, 1996, 57 (4): 197–203, S2CID 2442557, arXiv:math/9410211 , doi:10.1016/0020-0190(95)00190-5 .
Kinnersley (1992); Takahashi, Ueno & Kajitani (1994); Bodlaender (1998), p. 8. Kinnersley, Nancy G., The vertex separation number of a graph equals its path-width, Information Processing Letters, 1992, 42 (6): 345–350, doi:10.1016/0020-0190(92)90234-M  . Takahashi, Atsushi; Ueno, Shuichi; Kajitani, Yoji, Minimal acyclic forbidden minors for the family of graphs with bounded path-width, Discrete Mathematics, 1994, 127 (1–3): 293–304, doi:10.1016/0012-365X(94)90092-2  . Bodlaender, Hans L., A partial k-arboretum of graphs with bounded treewidth, Theoretical Computer Science, 1998, 209 (1–2): 1–45, doi:10.1016/S0304-3975(97)00228-4  .
Kinnersley & Langston (1994). Kinnersley, Nancy G.; Langston, Michael A., Obstruction set isolation for the gate matrix layout problem, Discrete Applied Mathematics, 1994, 54 (2–3): 169–213, doi:10.1016/0166-218X(94)90021-3  .
Demaine, Hajiaghayi & Kawarabayashi (2005). Demaine, Erik D.; Hajiaghayi, MohammadTaghi; Kawarabayashi, Ken-ichi, Algorithmic graph minor theory: decomposition, approximation, and coloring, Proc. 46th IEEE Symposium on Foundations of Computer Science (FOCS 2005): 637–646, 2005, ISBN 0-7695-2468-0, S2CID 13238254, doi:10.1109/SFCS.2005.14 .
Lopez & Law (1980). Lopez, Alexander D.; Law, Hung-Fai S., A dense gate matrix layout method for MOS VLSI, IEEE Transactions on Electron Devices, 1980, 27 (8): 1671–1675, Bibcode:1980ITED...27.1671L, S2CID 64469353, doi:10.1109/T-ED.1980.20086, Also in the joint issue, IEEE Journal of Solid-State Circuits 15 (4): 736–740, 1980 .
Fellows & Langston (1989). Fellows, Michael R.; Langston, Michael A., On search decision and the efficiency of polynomial-time algorithms, Proc. 21st ACM Symposium on Theory of Computing: 501–512, 1989, ISBN 0897913078, S2CID 1854173, doi:10.1145/73007.73055  .
Möhring (1990); Ferreira & Song (1992). Möhring, Rolf H., Graph problems related to gate matrix layout and PLA folding, Tinhofer, G.; Mayr, E.; Noltemeier, H.; et al (编), Computational Graph Theory, Computing Supplementum 7, Springer-Verlag: 17–51, 1990, ISBN 3-211-82177-5 . Ferreira, Afonso G.; Song, Siang W., Achieving optimality for gate matrix layout and PLA folding: a graph theoretic approach, Proc. 1st Latin American Symposium on Theoretical Informatics (LATIN '92), Lecture Notes in Computer Science 583, Springer-Verlag: 139–153, 1992, ISBN 3-540-55284-7, doi:10.1007/BFb0023825, hdl:10068/43314  .
Hliněny (2003). Hliněny, Petr, Crossing-number critical graphs have bounded path-width, Journal of Combinatorial Theory, Series B, 2003, 88 (2): 347–367, doi:10.1016/S0095-8956(03)00037-6  .
Suderman (2004). Suderman, Matthew, Pathwidth and layered drawings of trees (PDF), International Journal of Computational Geometry and Applications, 2004, 14 (3): 203–225, doi:10.1142/S0218195904001433, （原始内容 (PDF)存档于2003-05-03） .
Dujmović et al. (2008). Dujmović, V.; Fellows, M.R.; Kitching, M.; Liotta, G.; McCartin, C.; Nishimura, N.; Ragde, P.; Rosamond, F.; Whitesides, S.; Wood, David R., On the parameterized complexity of layered graph drawing, Algorithmica, 2008, 52 (2): 267–292, S2CID 2298634, doi:10.1007/s00453-007-9151-1 .
Miller (1956). Miller, George A., The Magical Number Seven, Plus or Minus Two, Psychological Review, 1956, 63 (2): 81–97 [2024-01-31], PMID 13310704, doi:10.1037/h0043158, hdl:11858/00-001M-0000-002C-4646-B , （原始内容存档于2008-05-30） .
Kneis et al. (2005); Björklund & Husfeldt (2008). Kneis, Joachim; Mölle, Daniel; Richter, Stefan; Rossmanith, Peter, Algorithms based on the treewidth of sparse graphs, Proc. 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2005), Lecture Notes in Computer Science 3787, Springer-Verlag: 385–396, 2005, ISBN 978-3-540-31000-6, doi:10.1007/11604686_34 . Björklund, Andreas; Husfeldt, Thore, Exact algorithms for exact satisfiability and number of perfect matchings, Algorithmica, 2008, 52 (2): 226–249, S2CID 37693881, doi:10.1007/s00453-007-9149-8 .

emis.de

Proskurowski & Telle (1999). Proskurowski, Andrzej; Telle, Jan Arne, Classes of graphs with restricted interval models (PDF), Discrete Mathematics and Theoretical Computer Science, 1999, 3: 167–176 [2024-01-31], （原始内容存档 (PDF)于2024-01-31） .

handle.net

hdl.handle.net

Bodlaender et al. (1992). Bodlaender, Hans L.; Gilbert, John R.; Hafsteinsson, Hjálmtýr; Kloks, Ton, Approximating treewidth, pathwidth, and minimum elimination tree height, Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science 570: 1–12, 1992, ISBN 978-3-540-55121-8, doi:10.1007/3-540-55121-2_1, hdl:1874/17927  .
Bodlaender (1996); Bodlaender & Kloks (1996) Bodlaender, Hans L., A linear-time algorithm for finding tree-decompositions of small treewidth, SIAM Journal on Computing, 1996, 25 (6): 1305–1317, doi:10.1137/S0097539793251219, hdl:1874/16670  . Bodlaender, Hans L.; Kloks, Ton, Efficient and constructive algorithms for the pathwidth and treewidth of graphs, Journal of Algorithms, 1996, 21 (2): 358–402, doi:10.1006/jagm.1996.0049, hdl:1874/16538  .
Bodlaender & Möhring (1990). Bodlaender, Hans L.; Möhring, Rolf H., The pathwidth and treewidth of cographs, Proc. 2nd Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science 447, Springer-Verlag: 301–309, 1990, ISBN 978-3-540-52846-3, doi:10.1007/3-540-52846-6_99, hdl:1874/16625  .
Bodlaender, Kloks & Kratsch (1993). Bodlaender, Hans L.; Kloks, Ton; Kratsch, Dieter, Treewidth and pathwidth of permutation graphs, Proc. 20th International Colloquium on Automata, Languages and Programming (ICALP 1993), Lecture Notes in Computer Science 700, Springer-Verlag: 114–125, 1993, ISBN 978-3-540-56939-8, doi:10.1007/3-540-56939-1_66, hdl:1874/16657  .
Fomin et al. (2008). Fomin, Fedor V.; Kratsch, Dieter; Todinca, Ioan; Villanger, Yngve, Exact algorithms for treewidth and minimum fill-in, SIAM Journal on Computing, 2008, 38 (3): 1058–1079, doi:10.1137/050643350, hdl:1956/1151  .
Kloks & Bodlaender (1992); Gustedt (1993). Kloks, Ton; Bodlaender, Hans L., Approximating treewidth and pathwidth of some classes of perfect graphs, Proc. 3rd International Symposium on Algorithms and Computation (ISAAC'92), Lecture Notes in Computer Science 650, Springer-Verlag: 116–125, 1992, ISBN 978-3-540-56279-5, doi:10.1007/3-540-56279-6_64, hdl:1874/16672  . Gustedt, Jens, On the pathwidth of chordal graphs, Discrete Applied Mathematics, 1993, 45 (3): 233–248, doi:10.1016/0166-218X(93)90012-D  .
Möhring (1990); Ferreira & Song (1992). Möhring, Rolf H., Graph problems related to gate matrix layout and PLA folding, Tinhofer, G.; Mayr, E.; Noltemeier, H.; et al (编), Computational Graph Theory, Computing Supplementum 7, Springer-Verlag: 17–51, 1990, ISBN 3-211-82177-5 . Ferreira, Afonso G.; Song, Siang W., Achieving optimality for gate matrix layout and PLA folding: a graph theoretic approach, Proc. 1st Latin American Symposium on Theoretical Informatics (LATIN '92), Lecture Notes in Computer Science 583, Springer-Verlag: 139–153, 1992, ISBN 3-540-55284-7, doi:10.1007/BFb0023825, hdl:10068/43314  .
Miller (1956). Miller, George A., The Magical Number Seven, Plus or Minus Two, Psychological Review, 1956, 63 (2): 81–97 [2024-01-31], PMID 13310704, doi:10.1037/h0043158, hdl:11858/00-001M-0000-002C-4646-B , （原始内容存档于2008-05-30） .

harvard.edu

ui.adsabs.harvard.edu

Lopez & Law (1980). Lopez, Alexander D.; Law, Hung-Fai S., A dense gate matrix layout method for MOS VLSI, IEEE Transactions on Electron Devices, 1980, 27 (8): 1671–1675, Bibcode:1980ITED...27.1671L, S2CID 64469353, doi:10.1109/T-ED.1980.20086, Also in the joint issue, IEEE Journal of Solid-State Circuits 15 (4): 736–740, 1980 .

inria.fr

hal.inria.fr

Möhring (1990); Scheffler (1990); Ellis, Sudborough & Turner (1994); Peng et al. (1998); Skodinis (2000); Skodinis (2003); Coudert, Huc & Mazauric (2012). Möhring, Rolf H., Graph problems related to gate matrix layout and PLA folding, Tinhofer, G.; Mayr, E.; Noltemeier, H.; et al (编), Computational Graph Theory, Computing Supplementum 7, Springer-Verlag: 17–51, 1990, ISBN 3-211-82177-5 . Scheffler, Petra, A linear algorithm for the pathwidth of trees, Bodendiek, R.; Henn, R. (编), Topics in Combinatorics and Graph Theory, Physica-Verlag: 613–620, 1990 . Ellis, J. A.; Sudborough, I. H.; Turner, J. S., The vertex separation and search number of a tree, Information and Computation, 1994, 113 (1): 50–79, doi:10.1006/inco.1994.1064  . Peng, Sheng-Lung; Ho, Chin-Wen; Hsu, Tsan-sheng; Ko, Ming-Tat; Tang, Chuan Yi, A linear-time algorithm for constructing an optimal node-search strategy of a tree, Proc. 4th Int. Conf. Computing and Combinatorics (COCOON'98), Lecture Notes in Computer Science 1449, Springer-Verlag: 197–205, 1998 ^{[失效連結]}. Skodinis, Konstantin, Computing optimal linear layouts of trees in linear time, Proc. 8th European Symposium on Algorithms (ESA 2000), Lecture Notes in Computer Science 1879, Springer-Verlag: 403–414, 2000, ISBN 978-3-540-41004-1, doi:10.1007/3-540-45253-2_37 . Skodinis, Konstantin, Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time, Journal of Algorithms, 2003, 47 (1): 40–59, doi:10.1016/S0196-6774(02)00225-0 . Coudert, David; Huc, Florian; Mazauric, Dorian, A Distributed Algorithm for Computing the Node Search Number in Trees (PDF), Algorithmica, 2012, 63 (1): 158–190 [2024-01-31], doi:10.1007/s00453-011-9524-3, （原始内容存档 (PDF)于2022-01-03） .
Bodlaender & Fomin (2002); Coudert, Huc & Sereni (2007). Bodlaender, Hans L.; Fomin, Fedor V., Approximation of pathwidth of outerplanar graphs, Journal of Algorithms, 2002, 43 (2): 190–200, doi:10.1016/S0196-6774(02)00001-9 . Coudert, David; Huc, Florian; Sereni, Jean-Sébastien, Pathwidth of outerplanar graphs (PDF), Journal of Graph Theory, 2007, 55 (1): 27–41 [2024-01-31], doi:10.1002/jgt.20218, （原始内容存档 (PDF)于2022-01-03） .

mcgill.ca

cgm.cs.mcgill.ca

Suderman (2004). Suderman, Matthew, Pathwidth and layered drawings of trees (PDF), International Journal of Computational Geometry and Applications, 2004, 14 (3): 203–225, doi:10.1142/S0218195904001433, （原始内容 (PDF)存档于2003-05-03） .

musanim.com

Miller (1956). Miller, George A., The Magical Number Seven, Plus or Minus Two, Psychological Review, 1956, 63 (2): 81–97 [2024-01-31], PMID 13310704, doi:10.1037/h0043158, hdl:11858/00-001M-0000-002C-4646-B , （原始内容存档于2008-05-30） .

nih.gov

ncbi.nlm.nih.gov

Miller (1956). Miller, George A., The Magical Number Seven, Plus or Minus Two, Psychological Review, 1956, 63 (2): 81–97 [2024-01-31], PMID 13310704, doi:10.1037/h0043158, hdl:11858/00-001M-0000-002C-4646-B , （原始内容存档于2008-05-30） .

semanticscholar.org

api.semanticscholar.org

Kashiwabara & Fujisawa (1979); Ohtsuki et al. (1979); Lengauer (1981); Arnborg, Corneil & Proskurowski (1987). Kashiwabara, T.; Fujisawa, T., NP-completeness of the problem of finding a minimum-clique-number interval graph containing a given graph as a subgraph, Proc. International Symposium on Circuits and Systems: 657–660, 1979 . Ohtsuki, Tatsuo; Mori, Hajimu; Kuh, Ernest S.; Kashiwabara, Toshinobu; Fujisawa, Toshio, One-dimensional logic gate assignment and interval graphs, IEEE Transactions on Circuits and Systems, 1979, 26 (9): 675–684, doi:10.1109/TCS.1979.1084695 . Lengauer, Thomas, Black-white pebbles and graph separation, Acta Informatica, 1981, 16 (4): 465–475, S2CID 19415148, doi:10.1007/BF00264496 . Arnborg, Stefan; Corneil, Derek G.; Proskurowski, Andrzej, Complexity of finding embeddings in a $k$ -tree, SIAM Journal on Algebraic and Discrete Methods, 1987, 8 (2): 277–284, doi:10.1137/0608024 .
Arnborg (1985). Arnborg, Stefan, Efficient algorithms for combinatorial problems on graphs with bounded decomposability – A survey, BIT, 1985, 25 (1): 2–23, S2CID 122263659, doi:10.1007/BF01934985 .
Aspvall, Proskurowski & Telle (2000). Aspvall, Bengt; Proskurowski, Andrzej; Telle, Jan Arne, Memory requirements for table computations in partial k-tree algorithms, Algorithmica, 2000, 27 (3): 382–394, S2CID 9690525, doi:10.1007/s004530010025 .
Golovach (1993). Golovach, P. A., The cutwidth of a graph and the vertex separation number of the line graph, Discrete Mathematics and Applications, 1993, 3 (5): 517–522, S2CID 120745961, doi:10.1515/dma.1993.3.5.517 .
Alon, Seymour & Thomas (1990). Alon, Noga; Seymour, Paul; Thomas, Robin, A separator theorem for graphs with an excluded minor and its applications, Proc. 22nd ACM Symp. on Theory of Computing (STOC 1990): 293–299, 1990, ISBN 0897913612, S2CID 17521329, doi:10.1145/100216.100254  .
Fomin (2003). Fomin, Fedor V., Pathwidth of planar and line graphs, Graphs and Combinatorics, 2003, 19 (1): 91–99, S2CID 43123449, doi:10.1007/s00373-002-0490-z .
Habib & Möhring (1994). Habib, Michel; Möhring, Rolf H., Treewidth of cocomparability graphs and a new order-theoretic parameter, Order, 1994, 11 (1): 47–60, S2CID 2648030, doi:10.1007/BF01462229 .
Feige, Hajiaghayi & Lee (2005). Feige, Uriel; Hajiaghayi, Mohammadtaghi; Lee, James R., Improved approximation algorithms for minimum-weight vertex separators, Proc. 37th ACM Symposium on Theory of Computing (STOC 2005): 563–572, 2005, ISBN 1581139608, S2CID 14097859, doi:10.1145/1060590.1060674 .
Bienstock et al. (1991); Diestel (1995); Cattell, Dinneen & Fellows (1996). Bienstock, Dan; Robertson, Neil; Seymour, Paul; Thomas, Robin, Quickly excluding a forest, Journal of Combinatorial Theory, Series B, 1991, 52 (2): 274–283, doi:10.1016/0095-8956(91)90068-U  . Diestel, Reinhard, Graph Minors I: a short proof of the path-width theorem, Combinatorics, Probability and Computing, 1995, 4 (1): 27–30, doi:10.1017/S0963548300001450 . Cattell, Kevin; Dinneen, Michael J.; Fellows, Michael R., A simple linear-time algorithm for finding path-decompositions of small width, Information Processing Letters, 1996, 57 (4): 197–203, S2CID 2442557, arXiv:math/9410211 , doi:10.1016/0020-0190(95)00190-5 .
Demaine, Hajiaghayi & Kawarabayashi (2005). Demaine, Erik D.; Hajiaghayi, MohammadTaghi; Kawarabayashi, Ken-ichi, Algorithmic graph minor theory: decomposition, approximation, and coloring, Proc. 46th IEEE Symposium on Foundations of Computer Science (FOCS 2005): 637–646, 2005, ISBN 0-7695-2468-0, S2CID 13238254, doi:10.1109/SFCS.2005.14 .
Lopez & Law (1980). Lopez, Alexander D.; Law, Hung-Fai S., A dense gate matrix layout method for MOS VLSI, IEEE Transactions on Electron Devices, 1980, 27 (8): 1671–1675, Bibcode:1980ITED...27.1671L, S2CID 64469353, doi:10.1109/T-ED.1980.20086, Also in the joint issue, IEEE Journal of Solid-State Circuits 15 (4): 736–740, 1980 .
Fellows & Langston (1989). Fellows, Michael R.; Langston, Michael A., On search decision and the efficiency of polynomial-time algorithms, Proc. 21st ACM Symposium on Theory of Computing: 501–512, 1989, ISBN 0897913078, S2CID 1854173, doi:10.1145/73007.73055  .
Dujmović et al. (2008). Dujmović, V.; Fellows, M.R.; Kitching, M.; Liotta, G.; McCartin, C.; Nishimura, N.; Ragde, P.; Rosamond, F.; Whitesides, S.; Wood, David R., On the parameterized complexity of layered graph drawing, Algorithmica, 2008, 52 (2): 267–292, S2CID 2298634, doi:10.1007/s00453-007-9151-1 .
Kneis et al. (2005); Björklund & Husfeldt (2008). Kneis, Joachim; Mölle, Daniel; Richter, Stefan; Rossmanith, Peter, Algorithms based on the treewidth of sparse graphs, Proc. 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2005), Lecture Notes in Computer Science 3787, Springer-Verlag: 385–396, 2005, ISBN 978-3-540-31000-6, doi:10.1007/11604686_34 . Björklund, Andreas; Husfeldt, Thore, Exact algorithms for exact satisfiability and number of perfect matchings, Algorithmica, 2008, 52 (2): 226–249, S2CID 37693881, doi:10.1007/s00453-007-9149-8 .

springerlink.com

Möhring (1990); Scheffler (1990); Ellis, Sudborough & Turner (1994); Peng et al. (1998); Skodinis (2000); Skodinis (2003); Coudert, Huc & Mazauric (2012). Möhring, Rolf H., Graph problems related to gate matrix layout and PLA folding, Tinhofer, G.; Mayr, E.; Noltemeier, H.; et al (编), Computational Graph Theory, Computing Supplementum 7, Springer-Verlag: 17–51, 1990, ISBN 3-211-82177-5 . Scheffler, Petra, A linear algorithm for the pathwidth of trees, Bodendiek, R.; Henn, R. (编), Topics in Combinatorics and Graph Theory, Physica-Verlag: 613–620, 1990 . Ellis, J. A.; Sudborough, I. H.; Turner, J. S., The vertex separation and search number of a tree, Information and Computation, 1994, 113 (1): 50–79, doi:10.1006/inco.1994.1064  . Peng, Sheng-Lung; Ho, Chin-Wen; Hsu, Tsan-sheng; Ko, Ming-Tat; Tang, Chuan Yi, A linear-time algorithm for constructing an optimal node-search strategy of a tree, Proc. 4th Int. Conf. Computing and Combinatorics (COCOON'98), Lecture Notes in Computer Science 1449, Springer-Verlag: 197–205, 1998 ^{[失效連結]}. Skodinis, Konstantin, Computing optimal linear layouts of trees in linear time, Proc. 8th European Symposium on Algorithms (ESA 2000), Lecture Notes in Computer Science 1879, Springer-Verlag: 403–414, 2000, ISBN 978-3-540-41004-1, doi:10.1007/3-540-45253-2_37 . Skodinis, Konstantin, Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time, Journal of Algorithms, 2003, 47 (1): 40–59, doi:10.1016/S0196-6774(02)00225-0 . Coudert, David; Huc, Florian; Mazauric, Dorian, A Distributed Algorithm for Computing the Node Search Number in Trees (PDF), Algorithmica, 2012, 63 (1): 158–190 [2024-01-31], doi:10.1007/s00453-011-9524-3, （原始内容存档 (PDF)于2022-01-03） .

uib.no

ii.uib.no

Bodlaender, Gustedt & Telle (1998). Bodlaender, Hans L.; Gustedt, Jens; Telle, Jan Arne, Linear-time register allocation for a fixed number of registers, Proc. 9th ACM–SIAM Symposium on Discrete Algorithms (SODA '98) (PDF): 574–583, 1998 [2024-01-31], （原始内容存档 (PDF)于2023-01-30） .

web.archive.org

Möhring (1990); Scheffler (1990); Ellis, Sudborough & Turner (1994); Peng et al. (1998); Skodinis (2000); Skodinis (2003); Coudert, Huc & Mazauric (2012). Möhring, Rolf H., Graph problems related to gate matrix layout and PLA folding, Tinhofer, G.; Mayr, E.; Noltemeier, H.; et al (编), Computational Graph Theory, Computing Supplementum 7, Springer-Verlag: 17–51, 1990, ISBN 3-211-82177-5 . Scheffler, Petra, A linear algorithm for the pathwidth of trees, Bodendiek, R.; Henn, R. (编), Topics in Combinatorics and Graph Theory, Physica-Verlag: 613–620, 1990 . Ellis, J. A.; Sudborough, I. H.; Turner, J. S., The vertex separation and search number of a tree, Information and Computation, 1994, 113 (1): 50–79, doi:10.1006/inco.1994.1064  . Peng, Sheng-Lung; Ho, Chin-Wen; Hsu, Tsan-sheng; Ko, Ming-Tat; Tang, Chuan Yi, A linear-time algorithm for constructing an optimal node-search strategy of a tree, Proc. 4th Int. Conf. Computing and Combinatorics (COCOON'98), Lecture Notes in Computer Science 1449, Springer-Verlag: 197–205, 1998 ^{[失效連結]}. Skodinis, Konstantin, Computing optimal linear layouts of trees in linear time, Proc. 8th European Symposium on Algorithms (ESA 2000), Lecture Notes in Computer Science 1879, Springer-Verlag: 403–414, 2000, ISBN 978-3-540-41004-1, doi:10.1007/3-540-45253-2_37 . Skodinis, Konstantin, Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time, Journal of Algorithms, 2003, 47 (1): 40–59, doi:10.1016/S0196-6774(02)00225-0 . Coudert, David; Huc, Florian; Mazauric, Dorian, A Distributed Algorithm for Computing the Node Search Number in Trees (PDF), Algorithmica, 2012, 63 (1): 158–190 [2024-01-31], doi:10.1007/s00453-011-9524-3, （原始内容存档 (PDF)于2022-01-03） .
Proskurowski & Telle (1999). Proskurowski, Andrzej; Telle, Jan Arne, Classes of graphs with restricted interval models (PDF), Discrete Mathematics and Theoretical Computer Science, 1999, 3: 167–176 [2024-01-31], （原始内容存档 (PDF)于2024-01-31） .
Bodlaender & Fomin (2002); Coudert, Huc & Sereni (2007). Bodlaender, Hans L.; Fomin, Fedor V., Approximation of pathwidth of outerplanar graphs, Journal of Algorithms, 2002, 43 (2): 190–200, doi:10.1016/S0196-6774(02)00001-9 . Coudert, David; Huc, Florian; Sereni, Jean-Sébastien, Pathwidth of outerplanar graphs (PDF), Journal of Graph Theory, 2007, 55 (1): 27–41 [2024-01-31], doi:10.1002/jgt.20218, （原始内容存档 (PDF)于2022-01-03） .
Suderman (2004). Suderman, Matthew, Pathwidth and layered drawings of trees (PDF), International Journal of Computational Geometry and Applications, 2004, 14 (3): 203–225, doi:10.1142/S0218195904001433, （原始内容 (PDF)存档于2003-05-03） .
Dujmović, Morin & Wood (2003). Dujmović, Vida; Morin, Pat; Wood, David R., Path-width and three-dimensional straight-line grid drawings of graphs (PDF), Proc. 10th International Symposium on Graph Drawing (GD 2002), Lecture Notes in Computer Science 2528, Springer-Verlag: 42–53, 2003 [2024-01-31], （原始内容存档 (PDF)于2012-03-04） .
Bodlaender, Gustedt & Telle (1998). Bodlaender, Hans L.; Gustedt, Jens; Telle, Jan Arne, Linear-time register allocation for a fixed number of registers, Proc. 9th ACM–SIAM Symposium on Discrete Algorithms (SODA '98) (PDF): 574–583, 1998 [2024-01-31], （原始内容存档 (PDF)于2023-01-30） .
Miller (1956). Miller, George A., The Magical Number Seven, Plus or Minus Two, Psychological Review, 1956, 63 (2): 81–97 [2024-01-31], PMID 13310704, doi:10.1037/h0043158, hdl:11858/00-001M-0000-002C-4646-B , （原始内容存档于2008-05-30） .