Finding a Nonempty Algebraic Subset of an Edge Set in Linear Time

DOI10.7155/JGAA.00144zbMATH Open1161.68687OpenAlexW2144989449MaRDI QIDQ5301414FDOQ5301414

Authors: Mauro Mezzini 

Publication date: 19 January 2009

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/JGAA/accepted/2007/Mezzini2007.11.1.pdf

Recommendations

• An FPT algorithm for edge subset feedback edge set
• scientific article; zbMATH DE number 3889547
• Polynomial recognition of equal unions in hypergraphs with few vertices of large degree
• Fundamentals of Computation Theory
• scientific article; zbMATH DE number 6503350

zbMATH Keywords

hypergraph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cited In (1)

• Finding connected components of a semialgebraic set in subexponential time

This page was built for publication: Finding a Nonempty Algebraic Subset of an Edge Set in Linear Time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301414)