On computing large temporal (unilateral) connected components

DOI10.1007/978-3-031-34347-6_24arXiv2302.12068OpenAlexW4379117553MaRDI QIDQ6182912

Isnard Lopes Costa, Andrea Marino, Unnamed Author, Raul Lopes

Publication date: 22 December 2023

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

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
• Fixed-parameter tractability and completeness II: On completeness for W[1]
• Into the square: on the complexity of some quadratic-time solvable problems
• On finding all unilaterally connected components of a digraph
• The maximum edge biclique problem is NP-complete
• The complexity of finding small separators in temporal graphs
• Components in time-varying graphs
• Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
• Computing the Minimum Fill-In is NP-Complete
• Connectivity and inference problems for temporal networks
• On the complexity of \(k\)-SAT
• Invited paper: Simple, strict, proper, happy: a study of reachability in temporal graphs

This page was built for publication: On computing large temporal (unilateral) connected components