Deterministic soliton graphs

MaRDI QIDQ3418606zbMATH OpenFDO

Authors Miklós Bartha, Miklós Krész

Publication date 5 February 2007

zbMATH Keywords

perfect matchingchestnut graphs

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Deciding the deterministic property for soliton graphs
• scientific article; zbMATH DE number 4060730
• Deterministic soliton automata with at most one cycle
• scientific article; zbMATH DE number 2016836
• Deterministic soliton automata with a single exterior node

Cited in

(9)

• scientific article; zbMATH DE number 2016836 (Why is no real title available?)
• Soliton Automata with Multiple Waves
• The power of linear-time data reduction for maximum matching
• On the König deficiency of zero-reducible graphs
• Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
• scientific article; zbMATH DE number 7584598 (Why is no real title available?)
• Computing unique maximum matchings in O(m) time for König-Egerváry graphs and unicyclic graphs
• scientific article; zbMATH DE number 4060730 (Why is no real title available?)
• Deciding the deterministic property for soliton graphs

This page was built for publication: Deterministic soliton graphs

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