Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs (Q691765): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.comgeo.2012.04.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2171133375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON STRUCTURAL AND GRAPH THEORETIC PROPERTIES OF HIGHER ORDER DELAUNAY GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural tolerance and Delaunay triangulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On crossing numbers of geometric proximity graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On circles containing the maximum number of points / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of some geometric type Kneser graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Spanning Ratio of Gabriel Graphs and beta-Skeletons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost all Delaunay triangulations have stretch factor greater than \(\pi /2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing with guaranteed delivery in ad hoc wireless networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Thickness of Complete Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delaunay graphs are almost as good as complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501348 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher order Delaunay triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering and coloring problems for relatives of intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some extremal results on circles containing points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of graphs which approximate the complete Euclidean graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring relatives of intervals on the plane. I: Chromatic number versus girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization for first order Delaunay triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of higher order Delaunay triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound for the Number of Vertices of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper bound on the stretch factor of delaunay triangulations / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:23, 5 July 2024

scientific article
Language Label Description Also known as
English
Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs
scientific article

    Statements

    Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    4 December 2012
    0 references
    proximity graphs
    0 references
    geometric graphs
    0 references

    Identifiers