{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:41Z","timestamp":1740107141382,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T00:00:00Z","timestamp":1498262400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s00373-017-1824-1","type":"journal-article","created":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T01:22:58Z","timestamp":1498267378000},"page":"1473-1483","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["$$l_p$$\n                \n                    \n                                    \n                        \n                            l\n                            p\n                        \n                    \n                \n            -Optimal Rankings and Max-Optimal Rankings are Different"],"prefix":"10.1007","volume":"33","author":[{"given":"Bonnie C.","family":"Jacob","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0219-895X","authenticated-orcid":false,"given":"Jobby","family":"Jacob","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,24]]},"reference":[{"key":"1824_CR1","first-page":"1","volume-title":"Graph-Theoretic Concepts in Computer Science (Fischbachau 1991). Lecture Notes in Computer science","author":"HL Bodlaender","year":"1992","unstructured":"Bodlaender, H.L., Gilbert, J.R., Hafsteinsson, H., Kloks, T.: Approximating treewidth, pathwidth, and minimum elimination tree height. Graph-Theoretic Concepts in Computer Science (Fischbachau 1991). Lecture Notes in Computer science, vol. 570, pp. 1\u201312. Springer, Berlin (1992)"},{"issue":"3","key":"1824_CR2","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1145\/356044.356047","volume":"9","author":"IS Duff","year":"1983","unstructured":"Duff, I.S., Reid, J.K.: The multifrontal solution of indefinite sparse symmetric linear equations. ACM Trans. Math. Softw. 9(3), 302\u2013325 (1983)","journal-title":"ACM Trans. Math. Softw."},{"issue":"1","key":"1824_CR3","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1137\/0611010","volume":"11","author":"JWH Liu","year":"1990","unstructured":"Liu, J.W.H.: The role of elimination trees in sparse factorization. SIAM J. Matrix Anal. Appl. 11(1), 134\u2013172 (1990)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1824_CR4","doi-asserted-by":"crossref","unstructured":"Leiserson, C.E.: Area-efficient graph layouts. In: IEEE Annual Symposium on Foundations of Computer Science, pp. 270 \u2013281 (1980)","DOI":"10.1109\/SFCS.1980.13"},{"issue":"2","key":"1824_CR5","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0020-0190(92)90017-P","volume":"43","author":"A Sen","year":"1992","unstructured":"Sen, A., Deng, H., Guha, S.: On a graph partition problem with application to VLSI layout. Inf. Process. Lett. 43(2), 87\u201394 (1992)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"1824_CR6","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0166-218X(91)90012-L","volume":"30","author":"AV Iyer","year":"1991","unstructured":"Iyer, A.V., Ratliff, H.D., Vijayan, G.: On an edge ranking problem of trees and graphs. Discret. Appl. Math. 30(1), 43\u201352 (1991)","journal-title":"Discret. Appl. Math."},{"issue":"6","key":"1824_CR7","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1007\/BF01189071","volume":"13","author":"P Torre de la","year":"1995","unstructured":"de la Torre, P., Greenlaw, R., Sch\u00e4ffer, A.A.: Optimal edge ranking of trees in polynomial time. Algorithmica 13(6), 592\u2013618 (1995)","journal-title":"Algorithmica"},{"issue":"23","key":"1824_CR8","doi-asserted-by":"crossref","first-page":"3324","DOI":"10.1016\/j.disc.2010.07.022","volume":"310","author":"H Alpert","year":"2010","unstructured":"Alpert, H.: Rank numbers of grid graphs. Discret. Math. 310(23), 3324\u20133333 (2010)","journal-title":"Discret. Math."},{"issue":"16","key":"1824_CR9","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1016\/j.ipl.2010.05.025","volume":"110","author":"CW Chang","year":"2010","unstructured":"Chang, C.W., Kuo, D., Lin, H.C.: Ranking numbers of graphs. Inform. Process. Lett. 110(16), 711\u2013716 (2010)","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"1824_CR10","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/(SICI)1097-0037(199608)28:1<45::AID-NET6>3.0.CO;2-D","volume":"28","author":"J Ghoshal","year":"1996","unstructured":"Ghoshal, J., Laskar, R., Pillone, D.: Minimal rankings. Networks 28(1), 45\u201353 (1996)","journal-title":"Networks"},{"key":"1824_CR11","unstructured":"Jacob, J.: Variations on graph products and vertex partitions. Ph.D. Thesis, Clemson University (2009)"},{"issue":"3","key":"1824_CR12","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/j.ipl.2008.10.004","volume":"109","author":"S Novotny","year":"2009","unstructured":"Novotny, S., Ortiz, J., Narayan, D.A.: Minimal \n                        $$k$$\n                        \n                            \n                                            \n                                k\n                            \n                        \n                    -rankings and the rank number of \n                        $$P^2_n$$\n                        \n                            \n                                            \n                                \n                                    P\n                                    n\n                                    2\n                                \n                            \n                        \n                    . Inf. Process. Lett. 109(3), 193\u2013198 (2009)","journal-title":"Inf. Process. Lett."},{"key":"1824_CR13","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s00010-011-0079-9","volume":"82","author":"E Sergel","year":"2011","unstructured":"Sergel, E., Richter, P., Tran, A., Curran, P., Jacob, J., Narayan, D.: Rank numbers for some trees and unicyclic graphs. Aequ. Math. 82, 65\u201379 (2011)","journal-title":"Aequ. Math."},{"issue":"1\u20132","key":"1824_CR14","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.ipl.2011.09.006","volume":"112","author":"RE Jamison","year":"2012","unstructured":"Jamison, R.E., Narayan, D.A.: Max-optimal and sum-optimal labelings of graphs. Inf. Process. Lett. 112(1\u20132), 26\u201331 (2012)","journal-title":"Inf. Process. Lett."},{"key":"1824_CR15","unstructured":"Jacob, B., Jacob, J.: A generalization of optimality in vertex rankings of graphs. Submitted (2016)"},{"key":"1824_CR16","unstructured":"Chen, J., Huo, X.: Sparse representations for multiple measurement vectors (MMV) in an over-complete dictionary. In: International Conference on Acoustics, Speech, vol.\u00a04. IEEE (2005)"},{"key":"1824_CR17","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1109\/TKDE.2003.1198388","volume":"15","author":"G Cormode","year":"2003","unstructured":"Cormode, G., Datar, M., Indyk, P., Muthukrishnan, S.: Comparing data streams using Hamming norms (how to zero in). IEEE Knowl. Data Eng. 15, 529\u2013540 (2003)","journal-title":"IEEE Knowl. Data Eng."},{"issue":"5","key":"1824_CR18","doi-asserted-by":"crossref","first-page":"2197","DOI":"10.1073\/pnas.0437847100","volume":"100","author":"DL Donoho","year":"2003","unstructured":"Donoho, D.L., Elad, M.: Optimally sparse representation in general (nonorthogonal) dictionaries via \n                        $$l^1$$\n                        \n                            \n                                            \n                                \n                                    l\n                                    1\n                                \n                            \n                        \n                     minimization. Proc. Natl. Acad. Sci. USA 100(5), 2197\u20132202 (2003). (electronic)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"issue":"1","key":"1824_CR19","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1109\/TMI.2008.927346","volume":"28","author":"J Trzasko","year":"2009","unstructured":"Trzasko, J., Manduca, A.: Highly undersampled magnetic resonance image reconstruction via homotopic \n                        $$\\ell _{0}$$\n                        \n                            \n                                            \n                                \n                                    \u2113\n                                    0\n                                \n                            \n                        \n                    -minimization. IEEE Trans. Med. Imaging 28(1), 106\u2013121 (2009)","journal-title":"IEEE Trans. Med. Imaging"},{"issue":"2","key":"1824_CR20","doi-asserted-by":"crossref","first-page":"175","DOI":"10.7151\/dmgt.1094","volume":"19","author":"E Bruoth","year":"1999","unstructured":"Bruoth, E., Hor\u0148\u00e1k, M.: On-line ranking number for cycles and paths. Discuss. Math. Graph Theory 19(2), 175\u2013197 (1999). (The Seventh Workshop \u201c3 in 1\u201d Graphs \u201998 (Krynica))","journal-title":"Discuss. Math. Graph Theory"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-017-1824-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1824-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1824-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,18]],"date-time":"2017-11-18T12:10:14Z","timestamp":1511007014000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-017-1824-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,24]]},"references-count":20,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["1824"],"URL":"https:\/\/doi.org\/10.1007\/s00373-017-1824-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2017,6,24]]}}}