The maximum infection time in the geodesic and monophonic convexities

DOI10.1016/j.tcs.2015.10.009zbMath1331.05201OpenAlexW2238704256MaRDI QIDQ897893

N. E. Zubov

Publication date: 8 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.10.009

zbMATH Keywords

geodesic convexitymaximum infection timemonophonic convexitymonophonic hull number

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

A necessary condition for the equality of the clique number and the convexity number of a graph ⋮ The maximum infection time of the \(P_3\) convexity in graphs with bounded maximum degree ⋮ On the hull number on cycle convexity of graphs ⋮ Target set selection with maximum activation time ⋮ The P3 infection time is W[1-hard parameterized by the treewidth] ⋮ Convex and isometric domination of (weak) dominating pair graphs

Cites Work

• Unnamed Item
• On slowly percolating sets of minimal size in bootstrap percolation
• Inapproximability results related to monophonic convexity
• Bootstrap percolation in living neural networks
• Bootstrap percolation in three dimensions
• Growth rates and explosions in sandpiles
• Complexity results related to monophonic convexity
• 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
• Decomposition by clique separators
• The hull number of a graph
• Distance-hereditary graphs
• On local convexity in graphs
• Convex sets in graphs. II: Minimal path convexity
• An algorithm for finding clique cut-sets
• Sharp metastability threshold for two-dimensional bootstrap percolation
• An introduction to clique minimal separator decomposition
• The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects
• Optimal decomposition by clique separators
• The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results
• Maximum Percolation Time in Two-Dimensional Bootstrap Percolation
• Convexity in Graphs and Hypergraphs
• On the Carathéodory Number for the Convexity of Paths of Order Three
• The sharp threshold for bootstrap percolation in all dimensions
• The complexity of theorem-proving procedures

This page was built for publication: The maximum infection time in the geodesic and monophonic convexities