Finding Even Subgraphs Even Faster (Q5275385): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
label / enlabel / en
 
Finding Even Subgraphs Even Faster
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.FSTTCS.2015.434 / 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: http://pubman.mpdl.mpg.de/pubman/item/escidoc:2259376 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3108844824 / rank
 
Normal rank
Property / title
 
Finding Even Subgraphs Even Faster (English)
Property / title: Finding Even Subgraphs Even Faster (English) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.FSTTCS.2015.434 / rank
 
Normal rank

Latest revision as of 16:36, 30 December 2024

scientific article; zbMATH DE number 6744935
Language Label Description Also known as
English
Finding Even Subgraphs Even Faster
scientific article; zbMATH DE number 6744935

    Statements

    0 references
    0 references
    0 references
    0 references
    0 references
    13 July 2017
    0 references
    Eulerian edge deletion
    0 references
    FPT
    0 references
    representative family
    0 references
    Finding Even Subgraphs Even Faster (English)
    0 references

    Identifiers