{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T13:40:29Z","timestamp":1772372429747,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,6,1]],"date-time":"1990-06-01T00:00:00Z","timestamp":644198400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8447,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1990,6]]},"DOI":"10.1016\/0166-218x(90)90065-k","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"195-207","source":"Crossref","is-referenced-by-count":32,"title":["On the computational complexity of upper fractional domination"],"prefix":"10.1016","volume":"27","author":[{"given":"Grant A.","family":"Cheston","sequence":"first","affiliation":[]},{"given":"G.","family":"Fricke","sequence":"additional","affiliation":[]},{"given":"S.T.","family":"Hedetniemi","sequence":"additional","affiliation":[]},{"given":"D.","family":"Pokrass Jacobs","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90065-K_BIB1","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF02579360","article-title":"Fractional matchings and covers in infinite hypergraphs","volume":"5","author":"Aharoni","year":"1985","journal-title":"Combinatorica"},{"key":"10.1016\/0166-218X(90)90065-K_BIB2","first-page":"3","article-title":"Packing problems and hypergraph theory: A survey","volume":"4","author":"Berge","year":"1979"},{"key":"10.1016\/0166-218X(90)90065-K_BIB3","author":"Catlin","year":"1988","journal-title":"Matroid unions, edge-toughness and fractional arboricity"},{"key":"10.1016\/0166-218X(90)90065-K_BIB4","first-page":"105","volume":"67","author":"Cheston","year":"1988","journal-title":"Simplicial graphs, Congr. Numer."},{"key":"10.1016\/0166-218X(90)90065-K_BIB5","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1137\/0401005","article-title":"On the fractional covering number of hypergraphs","volume":"1","author":"Chung","year":"1988","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0166-218X(90)90065-K_BIB6","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0012-365X(81)90268-5","article-title":"Contributions to the theory of domination, independence, and irredundance in graphs","volume":"33","author":"Cockayne","year":"1981","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(90)90065-K_BIB7","first-page":"227","article-title":"Fractional packings, coverings, and irredundance in graphs","volume":"66","author":"Domke","year":"1988","journal-title":"Congr. Numer."},{"key":"10.1016\/0166-218X(90)90065-K_BIB8","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-218X(84)90061-1","article-title":"Domination, independent domination and duality in strongly chordal graphs","volume":"7","author":"Farber","year":"1984","journal-title":"Discrete Applied Math."},{"key":"10.1016\/0166-218X(90)90065-K_BIB9","series-title":"A Guide to the Theory of NP-Completeness","article-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(90)90065-K_BIB10","first-page":"179","article-title":"A balanced hypergraph defined by certain subtrees of a tree","volume":"6","author":"Giles","year":"1978","journal-title":"Ars Combin."},{"key":"10.1016\/0166-218X(90)90065-K_BIB11","article-title":"Fractional domination and fractional packings in graphs","author":"Grinstead","year":"1988","journal-title":"Presented at the 19th Southeastern Conference on Combinatorics, Graph Theory, and Computing"},{"key":"10.1016\/0166-218X(90)90065-K_BIB12","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1016\/0377-2217(83)90197-2","article-title":"Covering problems and the uncapacitated plant location problem","volume":"12","author":"Kolen","year":"1983","journal-title":"European J. Oper. Res."},{"key":"10.1016\/0166-218X(90)90065-K_BIB13","series-title":"Proceedings 6th S.E. Conference on Combinatorics, Graph Theory, and Computing","first-page":"467","article-title":"Some linear algorithms on trees","author":"Mitchell","year":"1975"},{"key":"10.1016\/0166-218X(90)90065-K_BIB14","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/0022-0000(79)90053-9","article-title":"Linear algorithms on recursive representations of trees","volume":"18","author":"Mitchell","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0166-218X(90)90065-K_BIB15","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0166-218X(87)90053-9","article-title":"Fractional matchings and the Edmonds-Gallai theorem","volume":"16","author":"Pulleyblank","year":"1987","journal-title":"Discrete Applied Math."},{"key":"10.1016\/0166-218X(90)90065-K_BIB16","series-title":"Ph.D Dissertation","article-title":"Linear algorithms on k-terminal graphs","author":"Wimer","year":"1987"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090065K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090065K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:57:14Z","timestamp":1555120634000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9090065K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,6]]}},"alternative-id":["0166218X9090065K"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90065-k","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,6]]}}}