Computing the hull number in \(\Delta \)-convexity
DOI10.1016/j.tcs.2020.08.024zbMath1468.05047OpenAlexW3082410854MaRDI QIDQ2205950
Mitre C. Dourado, Bijo S. Anand, Manoj Changat, Arun Anil, Sabeer Sain Ramla
Publication date: 21 October 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.08.024
Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity aspects of the triangle path convexity
- 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
- The hull number of a graph
- On the geodetic hull number of \(P_{k}\)-free graphs
- On the Approximability of Influence in Social Networks
- Algorithmic Aspects of Vertex Elimination on Graphs
- Dually Chordal Graphs
- The Geodetic Hull Number is Hard for Chordal Graphs
- Convexity in Partial Cubes: The Hull Number
This page was built for publication: Computing the hull number in \(\Delta \)-convexity