Graph searching, elimination trees, and a generalization of bandwidth (Q1763148): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q300478
Created claim: DBLP publication ID (P1635): journals/algorithmica/FominHT04, #quickstatements; #temporary_batch_1741970510855
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-004-1117-y / rank
Normal rank
 
Property / author
 
Property / author: Jan Arne Telle / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q60488773 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-004-1117-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2026616451 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-004-1117-Y / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/algorithmica/FominHT04 / rank
 
Normal rank

Latest revision as of 17:43, 14 March 2025

scientific article
Language Label Description Also known as
English
Graph searching, elimination trees, and a generalization of bandwidth
scientific article

    Statements

    Graph searching, elimination trees, and a generalization of bandwidth (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 February 2005
    0 references
    Bandwidth
    0 references
    Graph searching
    0 references
    Elimination tree
    0 references
    Tree decomposition
    0 references
    Chordal graph
    0 references

    Identifiers