Reachability problems in interval-constrained and cardinality-constrained graphs

DOI10.1142/S1793830922501105OpenAlexW4225014282MaRDI QIDQ6132865FDOQ6132865

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

• An improved fixed-parameter algorithm for vertex cover
• Title not available (Why is that?)
• Phase transitions in social networks

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Realizing Interval Graphs with Size and Distance Constraints
• Reachability problems in edge-colored digraphs
• Interval propagation and search on directed acyclic graphs for numerical constraint solving
• On reachability in graphs with obstacles

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)