Directed ear anonymity

DOI10.1007/978-3-031-55601-2_6MaRDI QIDQ6547947

Marcelo Garlet Milani

Publication date: 31 May 2024

zbMATH Keywords

algorithmscomputational complexitydigraphsear anonymity

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Fundamentals of parameterized complexity
• Are there any good digraph width measures?
• The directed subgraph homeomorphism problem
• The minimum equivalent DNF problem and shortest implicants
• Directed tree-width
• Upper bounds to the clique width of graphs
• Digraph width measures in parameterized algorithmics
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Graph Theory
• The Directed Grid Theorem
• Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs
• Graph minors. II. Algorithmic aspects of tree-width
• Computational Complexity
• Treewidth: Structure and Algorithms
• Efficient algorithms for measuring the funnel-likeness of DAGs

This page was built for publication: Directed ear anonymity