Testing the diameter of graphs (Q4543626): 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.1002/rsa.10013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4248878005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of network synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property testing and its connection to learning and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527008 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:28, 4 June 2024

scientific article; zbMATH DE number 1777569
Language Label Description Also known as
English
Testing the diameter of graphs
scientific article; zbMATH DE number 1777569

    Statements

    Testing the diameter of graphs (English)
    0 references
    0 references
    0 references
    0 references
    8 August 2002
    0 references
    0 references
    graph algorithms
    0 references
    property testing
    0 references
    0 references