DOI: 10.1137/0603010. Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees

Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees

10.1137/0603010

Crossref journal-article

Society for Industrial & Applied Mathematics (SIAM)

SIAM Journal on Algebraic Discrete Methods (351)

Bibliography

Lengauer, T. (1982). Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees. SIAM Journal on Algebraic Discrete Methods, 3(1), 99â113.

Authors 1

Thomas Lengauer (first)

References 7 Referenced 49

{'key': 'R1', 'volume-title': 'On linear arrangements of trees', 'author': 'Chung F. R. K.', 'year': '1980'} / On linear arrangements of trees by Chung F. R. K. (1980)
{'key': 'R4', 'volume-title': 'Computers and intractability', 'author': 'Garey Michael R.', 'year': '1979'} / Computers and intractability by Garey Michael R. (1979)
10.1137/0112012
10.1016/0020-0190(80)90136-2
{'key': 'R9', 'volume-title': 'A comparison between two variations of a pebble game on graphs', 'author': 'Meyer auf der Heide Friedhelm', 'year': '1978'} / A comparison between two variations of a pebble game on graphs by Meyer auf der Heide Friedhelm (1978)
{'key': 'R10', 'first-page': '217', 'volume': '1', 'author': 'Persky G.', 'year': '1977', 'journal-title': 'J. Design Automat. and Fault-Tolerant Comput.'} / J. Design Automat. and Fault-Tolerant Comput. by Persky G. (1977)
10.1137/0208002

Dates

Type	When
Created	20 years, 5 months ago (Feb. 27, 2005, 2:03 a.m.)
Deposited	7 years, 4 months ago (March 23, 2018, 12:19 p.m.)
Indexed	1 year ago (Aug. 9, 2024, 4:30 p.m.)
Issued	43 years, 5 months ago (March 1, 1982)
Published	43 years, 5 months ago (March 1, 1982)
Published Print	43 years, 5 months ago (March 1, 1982)

Funders 0

None

BibTeX

@article{Lengauer_1982, title={Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees}, volume={3}, ISSN={2168-345X}, url={http://dx.doi.org/10.1137/0603010}, DOI={10.1137/0603010}, number={1}, journal={SIAM Journal on Algebraic Discrete Methods}, publisher={Society for Industrial & Applied Mathematics (SIAM)}, author={Lengauer, Thomas}, year={1982}, month=mar, pages={99–113} }

JSON

{
  "indexed": {
    "date-parts": [
      [
        2024,
        8,
        9
      ]
    ],
    "date-time": "2024-08-09T20:30:21Z",
    "timestamp": 1723235421996
  },
  "reference-count": 7,
  "publisher": "Society for Industrial & Applied Mathematics (SIAM)",
  "issue": "1",
  "content-domain": {
    "domain": [],
    "crossmark-restriction": false
  },
  "published-print": {
    "date-parts": [
      [
        1982,
        3
      ]
    ]
  },
  "DOI": "10.1137/0603010",
  "type": "journal-article",
  "created": {
    "date-parts": [
      [
        2005,
        2,
        27
      ]
    ],
    "date-time": "2005-02-27T07:03:43Z",
    "timestamp": 1109487823000
  },
  "page": "99-113",
  "source": "Crossref",
  "is-referenced-by-count": 49,
  "title": "Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees",
  "prefix": "10.1137",
  "volume": "3",
  "author": [
    {
      "given": "Thomas",
      "family": "Lengauer",
      "sequence": "first",
      "affiliation": []
    }
  ],
  "member": "351",
  "reference": [
    {
      "key": "R1",
      "volume-title": "On linear arrangements of trees",
      "author": "Chung F. R. K.",
      "year": "1980"
    },
    {
      "key": "R4",
      "volume-title": "Computers and intractability",
      "author": "Garey Michael R.",
      "year": "1979"
    },
    {
      "key": "R5",
      "doi-asserted-by": "publisher",
      "DOI": "10.1137/0112012"
    },
    {
      "key": "R8",
      "doi-asserted-by": "publisher",
      "DOI": "10.1016/0020-0190(80)90136-2"
    },
    {
      "key": "R9",
      "volume-title": "A comparison between two variations of a pebble game on graphs",
      "author": "Meyer auf der Heide Friedhelm",
      "year": "1978"
    },
    {
      "key": "R10",
      "first-page": "217",
      "volume": "1",
      "author": "Persky G.",
      "year": "1977",
      "journal-title": "J. Design Automat. and Fault-Tolerant Comput."
    },
    {
      "key": "R11",
      "doi-asserted-by": "publisher",
      "DOI": "10.1137/0208002"
    }
  ],
  "container-title": "SIAM Journal on Algebraic Discrete Methods",
  "original-title": [],
  "language": "en",
  "link": [
    {
      "URL": "https://epubs.siam.org/doi/pdf/10.1137/0603010",
      "content-type": "unspecified",
      "content-version": "vor",
      "intended-application": "similarity-checking"
    }
  ],
  "deposited": {
    "date-parts": [
      [
        2018,
        3,
        23
      ]
    ],
    "date-time": "2018-03-23T16:19:29Z",
    "timestamp": 1521821969000
  },
  "score": 1,
  "resource": {
    "primary": {
      "URL": "https://epubs.siam.org/doi/10.1137/0603010"
    }
  },
  "subtitle": [],
  "short-title": [],
  "issued": {
    "date-parts": [
      [
        1982,
        3
      ]
    ]
  },
  "references-count": 7,
  "journal-issue": {
    "issue": "1",
    "published-print": {
      "date-parts": [
        [
          1982,
          3
        ]
      ]
    }
  },
  "alternative-id": [
    "10.1137/0603010"
  ],
  "URL": "http://dx.doi.org/10.1137/0603010",
  "relation": {},
  "ISSN": [
    "0196-5212",
    "2168-345X"
  ],
  "subject": [],
  "container-title-short": "SIAM. J. on Algebraic and Discrete Methods",
  "published": {
    "date-parts": [
      [
        1982,
        3
      ]
    ]
  }
}