Monitoring edge-geodetic sets in graphs: extremal graphs, bounds, complexity
From MaRDI portal
Publication:6547818
DOI10.1007/978-3-031-52213-0_3MaRDI QIDQ6547818
Zin Mar Myint, Florent Foucaud, Sagnik Sen, Pierre-Marie Marcille, R. B. Sandeep, S. Taruni
Publication date: 31 May 2024
computational complexitychromatic numbergirthsubdivisionsgeodetic set\(k\)-clique summonitoring edge geodetic set
Algorithms in computer science (68Wxx) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph minors. XX: Wagner's conjecture
- Network verification via routing table queries
- Discovery of network properties with all-shortest-paths queries
- Some remarks on the geodetic number of a graph
- The geodetic number of a graph
- Graph minors. XVII: Taming a vortex
- Strong geodetic number of complete bipartite graphs and of graphs with specified diameter
- Complete graph minors and the graph minor structure theorem
- Exploring networks with traceroute-like probes: Theory and simulations
- Strong edge geodetic problem in networks
- On the approximation hardness of geodetic set and its variants
- On the geodetic number of a graph
- Graph minor theory
- Edge-Deletion Problems
- On The Edge Geodetic Number Of A Graph
- Parameterized Complexity of Geodetic Set
- Edge geodetic number of a graph
- Monitoring the edges of a graph using distances
- Algorithms and complexity for geodetic sets on partial grids
- Monitoring edge-geodetic sets: hardness and graph products
- Monitoring edge-geodetic sets in graphs
Related Items (1)
This page was built for publication: Monitoring edge-geodetic sets in graphs: extremal graphs, bounds, complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547818)
