The difficulty of beating the Taxman

DOI10.1016/j.dam.2023.06.019arXiv2211.00461OpenAlexW4382865194MaRDI QIDQ6064847

Robert K. Moniot, Atli Fannar Franklín

Publication date: 11 December 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2211.00461

zbMATH Keywords

combinatoricsgame theorymatchinggraph theoryTaxman

Mathematics Subject Classification ID

Theory of computing (68Qxx) Graph theory (05Cxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorial algorithms for feedback problems in directed graphs
• Alternating cycle-free matchings
• Efficient algorithms for finding maximum matching in graphs

This page was built for publication: The difficulty of beating the Taxman