Graph bandwidth: Difference between revisions

Revision as of 08:34, 13 April 2020

Revision as of 18:22, 10 December 2020

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

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

| first = Fan R. K.

| author-link =Fan Chung

| last2 =

| first2 =

| author2-link =

| year = 1988

| publication-date =

| contribution = Labelings of Graphs

| contribution-url =

| editor-last = Beineke

| editor-first = Lowell W.

| editor-link =

| editor2-last = Wilson

| editor2-first = Robin J.

| editor2-link =

| title = Selected Topics in Graph Theory

| edition =

| series =

| place =

| publication-place =

| publisher = Academic Press

| volume =

| pages = 151–168

| id =

| isbn = 978-0-12-086203-0

| doi =

| 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

| first = M.R.

| authorlinkauthor-link = Michael Garey

|author2=Johnson, D.S. |authorlink2author-link2=David S. Johnson

| title = [[Computers and Intractability: A Guide to the Theory of NP-Completeness]]

| year = 1979

Line 116 ⟶ 100:

| ___location = New York

| isbn = 0-7167-1045-5

| ref=harv

}}

*{{Citation

Line 127 ⟶ 110:

| issue = 4

| doi=10.4310/joc.2012.v3.n4.a5

| ref=harv

| arxiv = 1012.1344

}}

*{{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| doi-access = free }}

*{{Citation

| title = Pathwidth, bandwidth, and completion problems to proper interval graphs with small cliques

Line 140 ⟶ 122:

| last1 = Kaplan | first1 = Haim

| last2 = Shamir | first2 = Ron

| ref=harv

| doi=10.1137/s0097539793258143}}

*{{Cite journal

Line 151 ⟶ 132:

| year = 1997

| url = http://eccc.hpi-web.de/report/1997/017/

| ref=harv

}}