Reachability problems in interval-constrained and cardinality-constrained graphs

DOI10.1142/S1793830922501105MaRDI QIDQ6132865zbMATH OpenOpenAlexFDO

Authors Alvaro Velasquez, K. Subramani, Piotr Wojciechowski

Publication date 15 July 2023

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s1793830922501105

zbMATH Keywords

heterogeneityshortest pathsNP-hardnesscardinality constraintscomputer security

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cites work

• scientific article; zbMATH DE number 1617251 (Why is no real title available?)
• An improved fixed-parameter algorithm for vertex cover
• Phase transitions in social networks

Cited in

(6)

• scientific article; zbMATH DE number 5885701 (Why is no real title available?)
• On reachability in graphs with obstacles
• Realizing Interval Graphs with Size and Distance Constraints
• scientific article; zbMATH DE number 5587270 (Why is no real title available?)
• Interval propagation and search on directed acyclic graphs for numerical constraint solving
• Reachability problems in edge-colored digraphs

This page was built for publication: Reachability problems in interval-constrained and cardinality-constrained graphs

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