The complexity of growing a graph
Authors:
- George MertziosGMGeorge Mertzios
- Othon MichailOMOthon Michail
- George SkretasGSGeorge Skretas
- Paul G. SpirakisPSPaul G. Spirakis
- Michail TheofilatosMTMichail Theofilatos
Open Access
- 27 September 2024
- journal article
- research article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 147
Abstract
No abstract availableKeywords
Funding Information
- Engineering and Physical Sciences Research Council
This publication has 23 references indexed in Scilit:
- Distributed computation and reconfiguration in actively dynamic networksDistributed Computing, 2021
- Deleting edges to restrict the size of an epidemic in temporal networksJournal of Computer and System Sciences, 2021
- Temporal vertex cover with a sliding time windowJournal of Computer and System Sciences, 2020
- The complexity of finding small separators in temporal graphsJournal of Computer and System Sciences, 2020
- On the transformation capability of feasible mechanisms for programmable matterJournal of Computer and System Sciences, 2019
- Temporal Network Optimization Subject to Connectivity ConstraintsAlgorithmica, 2018
- Adaptive Energy Management for Incremental Deployment of Heterogeneous Wireless SensorsTheory of Computing Systems, 2007
- Connectivity and Inference Problems for Temporal NetworksJournal of Computer and System Sciences, 2002
- Vulnerability of scheduled networks and a generalization of Menger's TheoremNetworks, 1996
- Clique graphs and Helly graphsJournal of Combinatorial Theory, Series B, 1991