The maximum infection time in the geodesic and monophonic convexities

DOI10.1016/J.TCS.2015.10.009zbMATH Open1331.05201OpenAlexW2238704256MaRDI QIDQ897893FDOQ897893

Authors: 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

Recommendations

• The maximum infection time of the \(P_3\) convexity in graphs with bounded maximum degree
• Complexity of determining the maximum infection time in the geodetic convexity
• The P3 infection time is W[1]-hard parameterized by the treewidth
• Inapproximability results related to monophonic convexity
• The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects

zbMATH Keywords

geodesic convexitymaximum infection timemonophonic convexitymonophonic hull number

Mathematics Subject Classification ID

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

Cites Work

• Decomposition by clique separators
• On local convexity in graphs
• Title not available (Why is that?)
• Convexity in Graphs and Hypergraphs
• The complexity of theorem-proving procedures
• 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
• Optimal decomposition by clique separators
• On the Carathéodory number for the convexity of paths of order three
• Inapproximability results related to monophonic convexity
• Complexity results related to monophonic convexity
• The hull number of a graph
• Growth rates and explosions in sandpiles
• Sharp metastability threshold for two-dimensional bootstrap percolation
• Maximum Percolation Time in Two-Dimensional Bootstrap Percolation
• On slowly percolating sets of minimal size in bootstrap percolation
• The sharp threshold for bootstrap percolation in all dimensions
• Bootstrap percolation in living neural networks
• Bootstrap percolation in three dimensions
• An algorithm for finding clique cut-sets
• An introduction to clique minimal separator decomposition
• The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results
• The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects

Cited In (7)

• Convex and isometric domination of (weak) dominating pair graphs
• 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
• Complexity of determining the maximum infection time in the geodetic convexity
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897893)