Reconstructing trees from digitally convex sets (Q344865): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C60 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6656022 / rank
 
Normal rank
Property / zbMATH Keywords
 
digital convexity
Property / zbMATH Keywords: digital convexity / rank
 
Normal rank
Property / zbMATH Keywords
 
reconstructing graphs from their family of digitally convex sets
Property / zbMATH Keywords: reconstructing graphs from their family of digitally convex sets / rank
 
Normal rank
Property / zbMATH Keywords
 
recognizing families of digitally convex sets of trees
Property / zbMATH Keywords: recognizing families of digitally convex sets of trees / rank
 
Normal rank
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.dam.2014.08.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2028254056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing a Graph from its Neighborhood Lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a new framework for domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-Steiner simplicial orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal trees and monophonic convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity and HHD-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity in Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of reconstructing H-free graphs from their Star Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating and enumerating digitally convex sets of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A conjecture on the reconstruction of graphs from metric balls of their vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstruction of a graph from 2-vicinities of its vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local-Global Phenomena in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Trees and Convex Geometries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5298919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential Operations in Digital Picture Processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3259049 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141898 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 23:33, 12 July 2024

scientific article
Language Label Description Also known as
English
Reconstructing trees from digitally convex sets
scientific article

    Statements

    Reconstructing trees from digitally convex sets (English)
    0 references
    0 references
    0 references
    0 references
    24 November 2016
    0 references
    digital convexity
    0 references
    reconstructing graphs from their family of digitally convex sets
    0 references
    recognizing families of digitally convex sets of trees
    0 references

    Identifiers