Complexity of determining the maximum infection time in the geodetic convexity
DOI10.1016/J.ENDM.2015.07.067zbMATH Open1347.05041OpenAlexW2209105919MaRDI QIDQ324866FDOQ324866
Authors: F. S. Benevides, Victor Campos, Mitre C. Dourado, Ana Silva 
Publication date: 17 October 2016
Full work available at URL: https://doi.org/10.1016/j.endm.2015.07.067
Recommendations
- The maximum infection time in the geodesic and monophonic convexities
- scientific article; zbMATH DE number 5531985
- The maximum infection time of the \(P_3\) convexity in graphs with bounded maximum degree
- On the convexity number of graphs
- The convexity of induced paths of order three and applications: complexity aspects
Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Planar graphs; geometric and topological aspects of graph theory (05C10) General convexity (52A99)
Cites Work
- On local convexity in graphs
- Title not available (Why is that?)
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- On the computation of the hull number of a graph
- Distance-hereditary graphs
- Convex sets in graphs. II: Minimal path convexity
- On the Carathéodory number for the convexity of paths of order three
- Complexity results related to monophonic convexity
- The hull number of a graph
- Algorithms on clique separable graphs
- Maximum Percolation Time in Two-Dimensional Bootstrap Percolation
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: Complexity of determining the maximum infection time in the geodetic convexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324866)
