Graph bandwidth: Difference between revisions

Revision as of 12:57, 29 August 2015

Revision as of 15:09, 4 September 2015

Line 69:

==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 = }}

*{{cite doi|10.1016/j.ejc.2009.10.010}}

*{{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}}

*{{citation

Line 102:

| url = http://www.math.ucsd.edu/~fan/mypaps/fanpap/86log.PDF

}}

*{{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}}

*{{cite doi|10.1016/j.jcss.2010.06.006}}

* {{cite book

| last = Garey