Multi-parameter analysis of finding minors and subgraphs in edge-periodic temporal graphs

DOI10.1007/978-3-031-23101-8_19arXiv2203.07401OpenAlexW4313429598MaRDI QIDQ6169534

Petra Wolf, Unnamed Author, Nils Morawietz, Niels Grüttemeier, Frank Sommer

Publication date: 14 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

parameterized complexityFPT-algorithmtemporal graphsminor containmentsubgraph-freenesssubgraph containmentminor-freeness

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• Traveling salesman problems in temporal graphs
• An application of simultaneous diophantine approximation in combinatorial optimization
• Multiaspect graphs: algebraic representation and algorithms
• Temporal network optimization subject to connectivity constraints
• Graph minors. XIII: The disjoint paths problem
• Temporal vertex cover with a sliding time window
• Sliding window temporal graph coloring
• How fast can we reach a target vertex in stochastic temporal graphs?
• Integer Programming with a Fixed Number of Variables
• A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity
• Graph minor theory
• Minkowski's Convex Body Theorem and Integer Programming
• Reducibility among Combinatorial Problems
• COMPOSITIONALITY, COMPUTABILITY, AND COMPLEXITY
• Parameterized Algorithms
• Connectivity and inference problems for temporal networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Multi-parameter analysis of finding minors and subgraphs in edge-periodic temporal graphs