Computing the Girth of a Planar Graph in Linear Time (Q5891165): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Merged Item from Q5894220
 
(5 intermediate revisions by 5 users not shown)
description / endescription / en
scientific article; zbMATH DE number 6211595
scientific article; zbMATH DE number 5940012
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1353.68112 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-642-22685-4_20 / rank
 
Normal rank
Property / published in
 
Property / published in: Lecture Notes in Computer Science / rank
 
Normal rank
Property / publication date
 
17 August 2011
Timestamp+2011-08-17T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 17 August 2011 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5940012 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2764219506 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2144493643 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1104.4892 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:06, 6 May 2024

scientific article; zbMATH DE number 5940012
Language Label Description Also known as
English
Computing the Girth of a Planar Graph in Linear Time
scientific article; zbMATH DE number 5940012

    Statements

    Computing the Girth of a Planar Graph in Linear Time (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 September 2013
    0 references
    17 August 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    paths and cycles
    0 references
    planar graphs
    0 references
    graph algorithms
    0 references
    data structures
    0 references
    0 references
    0 references
    0 references