On the complexity of embedding planar graphs to minimize certain distance measures (Q582079): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Bienstock, Daniel / rank
Normal rank
 
Property / author
 
Property / author: Bienstock, Daniel / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03D15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 4129996 / rank
 
Normal rank
Property / zbMATH Keywords
 
embedding
Property / zbMATH Keywords: embedding / rank
 
Normal rank
Property / zbMATH Keywords
 
planar graphs
Property / zbMATH Keywords: planar graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
outer faces
Property / zbMATH Keywords: outer faces / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Covering Vertices by Faces in a Planar Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal enclosing regions in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dividing a Graph into Triconnected Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111952 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:11, 20 June 2024

scientific article
Language Label Description Also known as
English
On the complexity of embedding planar graphs to minimize certain distance measures
scientific article

    Statements

    On the complexity of embedding planar graphs to minimize certain distance measures (English)
    0 references
    0 references
    0 references
    0 references
    1990
    0 references
    embedding
    0 references
    planar graphs
    0 references
    outer faces
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references