Degeneracy graphs and the neighbourhood problem (Q1072933): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Latest revision as of 03:06, 5 March 2024

scientific article
Language Label Description Also known as
English
Degeneracy graphs and the neighbourhood problem
scientific article

    Statements

    Degeneracy graphs and the neighbourhood problem (English)
    0 references
    1986
    0 references
    This monograph deals with theory and applications of so-called degeneracy graphs being abstract representatives of degenerate vertices of convex polyhedra. In the first part (Chapter 1-4) the theory of degeneracy graphs is developed by introducing basic concepts and investigating structure and complexity of these special graphs. In the second part (Chapter 5) this theory is used for solving the so-called neighbourhood problems, i.e. the efficient determination of all neighbouring vertices of a degenerate vertex of interest. A solution method is proposed and its efficiency is tested.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    degeneration
    0 references
    degeneracy graphs
    0 references
    degenerate vertices of convex polyhedra
    0 references
    neighbourhood problems
    0 references
    solution method
    0 references