Content deleted Content added
Undid revision 704600498 by 2001:638:403:5050:1:0:0:83 (talk) the macro should be fixed instead. |
fix reflinks |
||
Line 71:
==References==
{{reflist}}
*{{Cite journal | last1 = Böttcher | first1 = J. | last2 = Pruessmann | first2 = K. P. | last3 = Taraz | first3 = A. | last4 = Würfl | first4 = A. | title = Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs | doi = 10.1016/j.ejc.2009.10.010 | journal = European Journal of Combinatorics | volume = 31 | pages = 1217–1227 | year = 2010 | pmid = | pmc = |ref=harv }}
*{{Cite journal | last1 = Chinn | first1 = P. Z. |author1-link=Phyllis Chinn| last2 = Chvátalová | first2 = J. | last3 = Dewdney | first3 = A. K. |author3-link=Alexander Dewdney| last4 = Gibbs | first4 = N. E. | title = The bandwidth problem for graphs and matrices—a survey | journal = Journal of Graph Theory | volume = 6 | pages = 223–254| year = 1982 | doi = 10.1002/jgt.3190060302 |ref=harv}}
*{{citation
| last = Chung
Line 103:
| oclc =
| url = http://www.math.ucsd.edu/~fan/mypaps/fanpap/86log.PDF
| ref=harv
}}
*{{Cite journal | last1 = Dubey | first1 = C. | last2 = Feige | first2 = U. | last3 = Unger | first3 = W. | title = Hardness results for approximating the bandwidth | journal = Journal of Computer and System Sciences | volume = 77 | pages = 62–90| year = 2010 | doi = 10.1016/j.jcss.2010.06.006 | ref=harv}}
* {{cite book
| last = Garey
Line 115 ⟶ 116:
| ___location = New York
| isbn = 0-7167-1045-5
| ref=harv
}}
*{{Citation
| title = On Balanced Separators, Treewidth, and Cycle Rank
| year = 2012
|
| journal = Journal of Combinatorics
| pages = 669–682
Line 125 ⟶ 127:
| issue = 4
| doi=10.4310/joc.2012.v3.n4.a5
| ref=harv
}}
*{{Cite journal | last1 = Harper | first1 = L. | title = Optimal numberings and isoperimetric problems on graphs | journal = Journal of Combinatorial Theory | volume = 1 | pages = 385–393 | year = 1966 | doi = 10.1016/S0021-9800(66)80059-5 |ref=harv}}
*{{Citation
| title = Pathwidth, bandwidth, and completion problems to proper interval graphs with small cliques
Line 136 ⟶ 139:
| last1 = Kaplan | first1 = Haim
| last2 = Shamir | first2 = Ron
| ref=harv
| doi=10.1137/s0097539793258143}}
*{{Cite journal
Line 146 ⟶ 150:
| year = 1997
| url = http://eccc.hpi-web.de/report/1997/017/
| ref=harv
}}
| |||