Algorithms and complexity for monitoring edge-geodetic sets in graphs
From MaRDI portal
Cites work
- An induced subgraph characterization of domination perfect graphs
- Detecting fixed patterns in chordal graphs in polynomial time
- Distance-based covering problems for graphs of given cyclomatic number
- Edge geodetic number of a graph
- Edge-Deletion Problems
- Exploring the gap between treedepth and vertex cover through vertex integrity
- Face covers and the genus problem for apex graphs
- Graph structure and monadic second-order logic. A language-theoretic approach
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 512914 (Why is no real title available?)
- scientific article; zbMATH DE number 554762 (Why is no real title available?)
- Linear time solvable optimization problems on graphs of bounded clique-width
- Monitoring edge-geodetic sets in graphs
- Monitoring edge-geodetic sets in graphs: extremal graphs, bounds, complexity
- Monitoring edge-geodetic sets: hardness and graph products
- Monitoring the edges of a graph using distances
- On The Edge Geodetic Number Of A Graph
- On the geodetic number of a graph
- On the Relationship Between Clique-Width and Treewidth
- Parameterized algorithms
- Parameterized complexity of geodetic set
- Some APX-completeness results for cubic graphs
- Strong geodetic number of complete bipartite graphs and of graphs with specified diameter
- The geodetic number of a graph
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Treewidth. Computations and approximations
- Which problems have strongly exponential complexity?
This page was built for publication: Algorithms and complexity for monitoring edge-geodetic sets in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7353766)
