割宽 (Chinese Wikipedia)

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

refsWebsite

Global rank Chinese rank

23doi.org

2^nd place

23^rd place

20ams.org

451^st place

935^th place

6web.archive.org

1^st place

5archive.org

6^th place

4^th place

2ucsd.edu

1,933^rd place

1,288^th place

2uoa.gr

9,203^rd place

low place

2princeton.edu

741^st place

907^th place

1upc.edu

low place

1semanticscholar.org

11^th place

332^nd place

1handle.net

102^nd place

492^nd place

1arxiv.org

69^th place

254^th place

ams.org

Chung, Fan R. K. On the cutwidth and the topological bandwidth of a tree (PDF). SIAM Journal on Algebraic and Discrete Methods. 1985, 6 (2): 268–277 [2024-01-29]. MR 0778007. doi:10.1137/0606026. （原始内容存档 (PDF)于2024-04-23）.
Thilikos, Dimitrios M.; Serna, Maria; Bodlaender, Hans L. Cutwidth I: A linear time fixed parameter algorithm (PDF). Journal of Algorithms. 2005, 56 (1): 1–24 [2024-01-29]. MR 2146375. doi:10.1016/j.jalgor.2004.12.001. （原始内容存档 (PDF)于2024-05-02）.
Korach, Ephraim; Solel, Nir. Tree-width, path-width, and cutwidth. Discrete Applied Mathematics. 1993, 43 (1): 97–101. MR 1218045. doi:10.1016/0166-218X(93)90171-J .
Chung, F. R. K.; Seymour, P. D. Graphs with small bandwidth and cutwidth (PDF). Discrete Mathematics. 1989, 75 (1-3): 113–119 [2024-01-29]. MR 1001391. doi:10.1016/0012-365X(89)90083-6. （原始内容存档 (PDF)于2024-01-30）.
Makedon, Fillia; Sudborough, Ivan Hal. On minimizing width in linear layouts. Discrete Applied Mathematics. 1989, 23 (3): 243–265. MR 0996137. doi:10.1016/0166-218X(89)90016-4 .
Djidjev, Hristo N.; Vrt'o, Imrich. Crossing numbers and cutwidths. Journal of Graph Algorithms and Applications. 2003, 7 (3): 245–251. MR 2112230. doi:10.7155/jgaa.00069 .
Stöhr, Elena. A trade-off between page number and page width of book embeddings of graphs. Information and Computation. 1988, 79 (2): 155–162. MR 0968104. doi:10.1016/0890-5401(88)90036-3 .
Yannakakis, Mihalis. A polynomial algorithm for the min-cut linear arrangement of trees. Journal of the ACM. 1985, 32 (4): 950–988. MR 0810346. doi:10.1145/4221.4228 .
Monien, B.; Sudborough, I. H. Min cut is NP-complete for edge weighted trees. Theoretical Computer Science. 1988, 58 (1-3): 209–229. MR 0963264. doi:10.1016/0304-3975(88)90028-X .
Bodlaender, Hans L.; Fomin, Fedor V.; Koster, Arie M. C. A.; Kratsch, Dieter; Thilikos, Dimitrios M. A note on exact algorithms for vertex ordering problems on graphs. Theory of Computing Systems. 2012, 50 (3): 420–432. MR 2885638. S2CID 9967521. doi:10.1007/s00224-011-9312-0. hdl:1956/4556 .
Ambainis, Andris; Balodis, Kaspars; Iraids, Jānis; Kokainis, Martins; Prūsis, Krišjānis; Vihrovs, Jevgēnijs. Chan, Timothy M. , 编. Proceedings of the Thirtieth Annual ACM–SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6–9, 2019. Society for Industrial and Applied Mathematics: 1783–1793. 2019. MR 3909576. arXiv:1807.05209 . doi:10.1137/1.9781611975482.107.
Giannopoulou, Archontia C.; Pilipczuk, Jean-Florent, Michałand Raymond; Thilikos, Dimitrios M.; Wrochna, Marcin. Cutwidth: obstructions and algorithmic aspects (PDF). Algorithmica. 2019, 81 (2): 557–588 [2024-01-29]. MR 3910081. doi:10.1007/s00453-018-0424-7. （原始内容存档 (PDF)于2024-01-30）.
Arora, Sanjeev; Frieze, Alan; Kaplan, Haim. A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. Mathematical Programming. 2002, 92 (1, Ser. A): 1–36 [2024-01-29]. MR 1892295. doi:10.1007/s101070100271. （原始内容存档于2023-04-09）.
Wu, Yu; Austrin, Per; Pitassi, Toniann; Liu, David. Inapproximability of treewidth, one-shot pebbling, and related layout problems. Journal of Artificial Intelligence Research. 2014, 49: 569–600. MR 3195329. doi:10.1613/jair.4030 .
Leighton, Tom; Rao, Satish. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM. 1999, 46 (6): 787–832. MR 1753034. doi:10.1145/331524.331526 .
Arora, Sanjeev; Rao, Satish; Vazirani, Umesh. Expander flows, geometric embeddings and graph partitioning (PDF). Journal of the ACM. 2009, 56 (2): Art. 5, 37 [2024-01-29]. MR 2535878. doi:10.1145/1502793.1502794. （原始内容存档 (PDF)于2024-06-16）.
Blin, Guillaume; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane. Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. Journal of Discrete Algorithms. 2008, 6 (4): 618–626. MR 2463425. doi:10.1016/j.jda.2008.03.004 .
Kayaaslan, Enver; Lambert, Thomas; Marchal, Loris; Uçar, Bora. Scheduling series-parallel task graphs to minimize peak memory. Theoretical Computer Science. 2018, 707: 1–23. MR 3734396. doi:10.1016/j.tcs.2017.09.037 .
Fotouhi, Farshad; Pramanik, Sakti. Problem of optimizing the number of block accesses in performing relational join is NP-hard. Information Processing Letters. 1991, 38 (5): 271–275. MR 1114421. doi:10.1016/0020-0190(91)90070-X.
Morin, Pat; Wood, David R. Three-dimensional 1-bend graph drawings. Journal of Graph Algorithms and Applications. 2004, 8 (3): 357–366. MR 2176967. doi:10.7155/jgaa.00095 .

archive.org

Korach, Ephraim; Solel, Nir. Tree-width, path-width, and cutwidth. Discrete Applied Mathematics. 1993, 43 (1): 97–101. MR 1218045. doi:10.1016/0166-218X(93)90171-J .
Makedon, Fillia; Sudborough, Ivan Hal. On minimizing width in linear layouts. Discrete Applied Mathematics. 1989, 23 (3): 243–265. MR 0996137. doi:10.1016/0166-218X(89)90016-4 .
Seymour, Paul D.; Thomas, Robin. Call routing and the ratcatcher. Combinatorica. 1994, 14 (2): 217–241. doi:10.1007/BF01215352.
Monien, B.; Sudborough, I. H. Min cut is NP-complete for edge weighted trees. Theoretical Computer Science. 1988, 58 (1-3): 209–229. MR 0963264. doi:10.1016/0304-3975(88)90028-X .
Fotouhi, Farshad; Pramanik, Sakti. Problem of optimizing the number of block accesses in performing relational join is NP-hard. Information Processing Letters. 1991, 38 (5): 271–275. MR 1114421. doi:10.1016/0020-0190(91)90070-X.

arxiv.org

Ambainis, Andris; Balodis, Kaspars; Iraids, Jānis; Kokainis, Martins; Prūsis, Krišjānis; Vihrovs, Jevgēnijs. Chan, Timothy M. , 编. Proceedings of the Thirtieth Annual ACM–SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6–9, 2019. Society for Industrial and Applied Mathematics: 1783–1793. 2019. MR 3909576. arXiv:1807.05209 . doi:10.1137/1.9781611975482.107.

doi.org

Chung, Fan R. K. On the cutwidth and the topological bandwidth of a tree (PDF). SIAM Journal on Algebraic and Discrete Methods. 1985, 6 (2): 268–277 [2024-01-29]. MR 0778007. doi:10.1137/0606026. （原始内容存档 (PDF)于2024-04-23）.
Thilikos, Dimitrios M.; Serna, Maria; Bodlaender, Hans L. Cutwidth I: A linear time fixed parameter algorithm (PDF). Journal of Algorithms. 2005, 56 (1): 1–24 [2024-01-29]. MR 2146375. doi:10.1016/j.jalgor.2004.12.001. （原始内容存档 (PDF)于2024-05-02）.
Korach, Ephraim; Solel, Nir. Tree-width, path-width, and cutwidth. Discrete Applied Mathematics. 1993, 43 (1): 97–101. MR 1218045. doi:10.1016/0166-218X(93)90171-J .
Chung, F. R. K.; Seymour, P. D. Graphs with small bandwidth and cutwidth (PDF). Discrete Mathematics. 1989, 75 (1-3): 113–119 [2024-01-29]. MR 1001391. doi:10.1016/0012-365X(89)90083-6. （原始内容存档 (PDF)于2024-01-30）.
Makedon, Fillia; Sudborough, Ivan Hal. On minimizing width in linear layouts. Discrete Applied Mathematics. 1989, 23 (3): 243–265. MR 0996137. doi:10.1016/0166-218X(89)90016-4 .
Díaz, Josep; Petit, Jordi; Serna, Maria. A survey of graph layout problems (PDF). ACM Computing Surveys. September 2002, 34 (3): 313–356. doi:10.1145/568522.568523. ^{[失效連結]}
Seymour, Paul D.; Thomas, Robin. Call routing and the ratcatcher. Combinatorica. 1994, 14 (2): 217–241. doi:10.1007/BF01215352.
Djidjev, Hristo N.; Vrt'o, Imrich. Crossing numbers and cutwidths. Journal of Graph Algorithms and Applications. 2003, 7 (3): 245–251. MR 2112230. doi:10.7155/jgaa.00069 .
Stöhr, Elena. A trade-off between page number and page width of book embeddings of graphs. Information and Computation. 1988, 79 (2): 155–162. MR 0968104. doi:10.1016/0890-5401(88)90036-3 .
Yannakakis, Mihalis. A polynomial algorithm for the min-cut linear arrangement of trees. Journal of the ACM. 1985, 32 (4): 950–988. MR 0810346. doi:10.1145/4221.4228 .
Monien, B.; Sudborough, I. H. Min cut is NP-complete for edge weighted trees. Theoretical Computer Science. 1988, 58 (1-3): 209–229. MR 0963264. doi:10.1016/0304-3975(88)90028-X .
Bodlaender, Hans L.; Fomin, Fedor V.; Koster, Arie M. C. A.; Kratsch, Dieter; Thilikos, Dimitrios M. A note on exact algorithms for vertex ordering problems on graphs. Theory of Computing Systems. 2012, 50 (3): 420–432. MR 2885638. S2CID 9967521. doi:10.1007/s00224-011-9312-0. hdl:1956/4556 .
Ambainis, Andris; Balodis, Kaspars; Iraids, Jānis; Kokainis, Martins; Prūsis, Krišjānis; Vihrovs, Jevgēnijs. Chan, Timothy M. , 编. Proceedings of the Thirtieth Annual ACM–SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6–9, 2019. Society for Industrial and Applied Mathematics: 1783–1793. 2019. MR 3909576. arXiv:1807.05209 . doi:10.1137/1.9781611975482.107.
Giannopoulou, Archontia C.; Pilipczuk, Jean-Florent, Michałand Raymond; Thilikos, Dimitrios M.; Wrochna, Marcin. Cutwidth: obstructions and algorithmic aspects (PDF). Algorithmica. 2019, 81 (2): 557–588 [2024-01-29]. MR 3910081. doi:10.1007/s00453-018-0424-7. （原始内容存档 (PDF)于2024-01-30）.
Fellows, Michael R.; Lokshtanov, Daniel; Misra, Neeldhara; Rosamond, Frances A.; Saurabh, Saket. Hong, Seok-Hee; Nagamochi, Hiroshi; Fukunaga, Takuro , 编. Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15–17, 2008, Proceedings. Lecture Notes in Computer Science 5369. Springer: 294–305. 2008. doi:10.1007/978-3-540-92182-0_28.
Arora, Sanjeev; Frieze, Alan; Kaplan, Haim. A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. Mathematical Programming. 2002, 92 (1, Ser. A): 1–36 [2024-01-29]. MR 1892295. doi:10.1007/s101070100271. （原始内容存档于2023-04-09）.
Wu, Yu; Austrin, Per; Pitassi, Toniann; Liu, David. Inapproximability of treewidth, one-shot pebbling, and related layout problems. Journal of Artificial Intelligence Research. 2014, 49: 569–600. MR 3195329. doi:10.1613/jair.4030 .
Leighton, Tom; Rao, Satish. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM. 1999, 46 (6): 787–832. MR 1753034. doi:10.1145/331524.331526 .
Arora, Sanjeev; Rao, Satish; Vazirani, Umesh. Expander flows, geometric embeddings and graph partitioning (PDF). Journal of the ACM. 2009, 56 (2): Art. 5, 37 [2024-01-29]. MR 2535878. doi:10.1145/1502793.1502794. （原始内容存档 (PDF)于2024-06-16）.
Blin, Guillaume; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane. Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. Journal of Discrete Algorithms. 2008, 6 (4): 618–626. MR 2463425. doi:10.1016/j.jda.2008.03.004 .
Kayaaslan, Enver; Lambert, Thomas; Marchal, Loris; Uçar, Bora. Scheduling series-parallel task graphs to minimize peak memory. Theoretical Computer Science. 2018, 707: 1–23. MR 3734396. doi:10.1016/j.tcs.2017.09.037 .
Fotouhi, Farshad; Pramanik, Sakti. Problem of optimizing the number of block accesses in performing relational join is NP-hard. Information Processing Letters. 1991, 38 (5): 271–275. MR 1114421. doi:10.1016/0020-0190(91)90070-X.
Morin, Pat; Wood, David R. Three-dimensional 1-bend graph drawings. Journal of Graph Algorithms and Applications. 2004, 8 (3): 357–366. MR 2176967. doi:10.7155/jgaa.00095 .

handle.net

hdl.handle.net

Bodlaender, Hans L.; Fomin, Fedor V.; Koster, Arie M. C. A.; Kratsch, Dieter; Thilikos, Dimitrios M. A note on exact algorithms for vertex ordering problems on graphs. Theory of Computing Systems. 2012, 50 (3): 420–432. MR 2885638. S2CID 9967521. doi:10.1007/s00224-011-9312-0. hdl:1956/4556 .

princeton.edu

cs.princeton.edu

Arora, Sanjeev; Frieze, Alan; Kaplan, Haim. A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. Mathematical Programming. 2002, 92 (1, Ser. A): 1–36 [2024-01-29]. MR 1892295. doi:10.1007/s101070100271. （原始内容存档于2023-04-09）.
Arora, Sanjeev; Rao, Satish; Vazirani, Umesh. Expander flows, geometric embeddings and graph partitioning (PDF). Journal of the ACM. 2009, 56 (2): Art. 5, 37 [2024-01-29]. MR 2535878. doi:10.1145/1502793.1502794. （原始内容存档 (PDF)于2024-06-16）.

semanticscholar.org

api.semanticscholar.org

Bodlaender, Hans L.; Fomin, Fedor V.; Koster, Arie M. C. A.; Kratsch, Dieter; Thilikos, Dimitrios M. A note on exact algorithms for vertex ordering problems on graphs. Theory of Computing Systems. 2012, 50 (3): 420–432. MR 2885638. S2CID 9967521. doi:10.1007/s00224-011-9312-0. hdl:1956/4556 .

ucsd.edu

mathweb.ucsd.edu

Chung, Fan R. K. On the cutwidth and the topological bandwidth of a tree (PDF). SIAM Journal on Algebraic and Discrete Methods. 1985, 6 (2): 268–277 [2024-01-29]. MR 0778007. doi:10.1137/0606026. （原始内容存档 (PDF)于2024-04-23）.
Chung, F. R. K.; Seymour, P. D. Graphs with small bandwidth and cutwidth (PDF). Discrete Mathematics. 1989, 75 (1-3): 113–119 [2024-01-29]. MR 1001391. doi:10.1016/0012-365X(89)90083-6. （原始内容存档 (PDF)于2024-01-30）.

uoa.gr

users.uoa.gr

Thilikos, Dimitrios M.; Serna, Maria; Bodlaender, Hans L. Cutwidth I: A linear time fixed parameter algorithm (PDF). Journal of Algorithms. 2005, 56 (1): 1–24 [2024-01-29]. MR 2146375. doi:10.1016/j.jalgor.2004.12.001. （原始内容存档 (PDF)于2024-05-02）.
Giannopoulou, Archontia C.; Pilipczuk, Jean-Florent, Michałand Raymond; Thilikos, Dimitrios M.; Wrochna, Marcin. Cutwidth: obstructions and algorithmic aspects (PDF). Algorithmica. 2019, 81 (2): 557–588 [2024-01-29]. MR 3910081. doi:10.1007/s00453-018-0424-7. （原始内容存档 (PDF)于2024-01-30）.

upc.edu

cs.upc.edu

Díaz, Josep; Petit, Jordi; Serna, Maria. A survey of graph layout problems (PDF). ACM Computing Surveys. September 2002, 34 (3): 313–356. doi:10.1145/568522.568523. ^{[失效連結]}

web.archive.org

Chung, Fan R. K. On the cutwidth and the topological bandwidth of a tree (PDF). SIAM Journal on Algebraic and Discrete Methods. 1985, 6 (2): 268–277 [2024-01-29]. MR 0778007. doi:10.1137/0606026. （原始内容存档 (PDF)于2024-04-23）.
Thilikos, Dimitrios M.; Serna, Maria; Bodlaender, Hans L. Cutwidth I: A linear time fixed parameter algorithm (PDF). Journal of Algorithms. 2005, 56 (1): 1–24 [2024-01-29]. MR 2146375. doi:10.1016/j.jalgor.2004.12.001. （原始内容存档 (PDF)于2024-05-02）.
Chung, F. R. K.; Seymour, P. D. Graphs with small bandwidth and cutwidth (PDF). Discrete Mathematics. 1989, 75 (1-3): 113–119 [2024-01-29]. MR 1001391. doi:10.1016/0012-365X(89)90083-6. （原始内容存档 (PDF)于2024-01-30）.
Giannopoulou, Archontia C.; Pilipczuk, Jean-Florent, Michałand Raymond; Thilikos, Dimitrios M.; Wrochna, Marcin. Cutwidth: obstructions and algorithmic aspects (PDF). Algorithmica. 2019, 81 (2): 557–588 [2024-01-29]. MR 3910081. doi:10.1007/s00453-018-0424-7. （原始内容存档 (PDF)于2024-01-30）.
Arora, Sanjeev; Frieze, Alan; Kaplan, Haim. A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. Mathematical Programming. 2002, 92 (1, Ser. A): 1–36 [2024-01-29]. MR 1892295. doi:10.1007/s101070100271. （原始内容存档于2023-04-09）.
Arora, Sanjeev; Rao, Satish; Vazirani, Umesh. Expander flows, geometric embeddings and graph partitioning (PDF). Journal of the ACM. 2009, 56 (2): Art. 5, 37 [2024-01-29]. MR 2535878. doi:10.1145/1502793.1502794. （原始内容存档 (PDF)于2024-06-16）.