References in zbMATH (referenced in 161 articles )

Showing results 101 to 120 of 161.
Sorted by year (citations)
  1. Goodrich, Timothy D.; Sullivan, Blair D.; Humble, Travis S.: Optimizing adiabatic quantum program compilation using a graph-theoretic framework (2018)
  2. Heroy, Samuel; Taylor, Dane; Shi, F. Bill; Forest, M. Gregory; Mucha, Peter J.: Rigid graph compression: motif-based rigidity analysis for disordered fiber networks (2018)
  3. Hyman, Jeffrey D.; Hagberg, Aric; Osthus, Dave; Srinivasan, Shriram; Viswanathan, Hari; Srinivasan, Gowri: Identifying backbones in three-dimensional discrete fracture networks: a bipartite graph-based approach (2018)
  4. Ignatiev, Alexey; Morgado, Antonio; Marques-Silva, Joao: PySAT: a Python toolkit for prototyping with SAT oracles (2018)
  5. Jakob Bossek: grapherator: A Modular Multi-Step Graph Generator (2018) not zbMATH
  6. Jason Laura; Kelvin Rodriguez; Adam C. Paquette; Evin Dunn: AutoCNet: A Python library for sparse multi-image correspondence identification for planetary data (2018) not zbMATH
  7. Matsypura, Dmytro; Prokopyev, Oleg A.; Zahar, Aizat: Wildfire fuel management: network-based models and optimization of prescribed burning (2018)
  8. Melo De Oliveira, Nicolas; Martins De Abreu Silva, Ricardo; De Oliveira, Wilson Rosa: QUBO formulation for the contact map overlap problem (2018)
  9. Moazzez, Babak; Soltani, Hossein: Integer programming approach to static monopolies in graphs (2018)
  10. Morin, Michael; Castro, Margarita P.; Booth, Kyle E. C.; Tran, Tony T.; Liu, Chang; Beck, J. Christopher: Intruder alert! Optimization models for solving the mobile robot graph-clear problem (2018)
  11. Pavlikov, Konstantin: Improved formulations for minimum connectivity network interdiction problems (2018)
  12. Sladek, Vladimir: A note on the interpretation of the efficiency centrality (2018)
  13. Srinivasan, Shriram; Hyman, Jeffrey; Karra, Satish; O’Malley, Daniel; Viswanathan, Hari; Srinivasan, Gowri: Robust system size reduction of discrete fracture networks: a multi-fidelity method that preserves transport characteristics (2018)
  14. Valera, Manuel; Guo, Zhengyang; Kelly, Priscilla; Matz, Sean; Cantu, Vito Adrian; Percus, Allon G.; Hyman, Jeffrey D.; Srinivasan, Gowri; Viswanathan, Hari S.: Machine learning for graph-based representations of three-dimensional discrete fracture networks (2018)
  15. von Kleist, Max; Schütte, Christof; Zhang, Wei: Statistical analysis of the first passage path ensemble of jump processes (2018)
  16. Avni, Guy; Goel, Shubham; Henzinger, Thomas A.; Rodriguez-Navas, Guillermo: Computing scores of forwarding schemes in switched networks with probabilistic faults (2017)
  17. Boroojeni, Asma Azizi; Dewar, Jeremy; Wu, Tong; Hyman, James M.: Generating bipartite networks with a prescribed joint degree distribution (2017)
  18. Changaival, Boonyarit; Rosalie, Martin; Danoy, Grégoire; Lavangnananda, Kittichai; Bouvry, Pascal: Chaotic traversal (CHAT): very large graphs traversal using chaotic dynamics (2017)
  19. De Luca, Felice; Di Giacomo, Emilio; Didimo, Walter; Kobourov, Stephen; Liotta, Giuseppe: An experimental study on the ply number of straight-line drawings (2017)
  20. D. Ranathunga, H. Nguyen, M. Roughan: MGtoolkit: A python package for implementing metagraphs (2017) not zbMATH