NetworkX

NetworkX (NX) is a Python package for the creation, manipulation, and study of the structure, dynamics, and functions of complex networks.

This software is also referenced in ORMS.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 50 articles )

Showing results 1 to 20 of 50.
Sorted by year (citations)

1 2 3 next

  1. Justel, Claudia; Rocha, Carlos; Chaves, Emanuelle; Chaves, Anderson; Avelino, Geraldo: Augmenting the algebraic connectivity for certain families of graphs (2019)
  2. Ansmann, Gerrit: Efficiently and easily integrating differential equations with JiTCODE, JiTCDDE, and JiTCSDE (2018)
  3. Catherine Zucker; Hope How-Huan Chen: RadFil: a Python Package for Building and Fitting Radial Profiles for Interstellar Filaments (2018) arXiv
  4. Goerigk, Marc; Hamacher, Horst W.; Kinscherff, Anika: Ranking robustness and its application to evacuation planning (2018)
  5. Goodrich, Timothy D.; Sullivan, Blair D.; Humble, Travis S.: Optimizing adiabatic quantum program compilation using a graph-theoretic framework (2018)
  6. 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)
  7. Ignatiev, Alexey; Morgado, Antonio; Marques-Silva, Joao: PySAT: A Python toolkit for prototyping with SAT oracles (2018)
  8. Jason Laura; Kelvin Rodriguez; Adam C. Paquette; Evin Dunn: AutoCNet: A Python library for sparse multi-image correspondence identification for planetary data (2018)
  9. Matsypura, Dmytro; Prokopyev, Oleg A.; Zahar, Aizat: Wildfire fuel management: network-based models and optimization of prescribed burning (2018)
  10. Moazzez, Babak; Soltani, Hossein: Integer programming approach to static monopolies in graphs (2018)
  11. 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)
  12. Pavlikov, Konstantin: Improved formulations for minimum connectivity network interdiction problems (2018)
  13. von Kleist, Max; Schütte, Christof; Zhang, Wei: Statistical analysis of the first passage path ensemble of jump processes (2018)
  14. Changaival, Boonyarit; Rosalie, Martin; Danoy, Grégoire; Lavangnananda, Kittichai; Bouvry, Pascal: Chaotic traversal (CHAT): very large graphs traversal using chaotic dynamics (2017)
  15. De Luca, Felice; Di Giacomo, Emilio; Didimo, Walter; Kobourov, Stephen; Liotta, Giuseppe: An experimental study on the ply number of straight-line drawings (2017)
  16. D. Ranathunga, H. Nguyen, M. Roughan: MGtoolkit: A python package for implementing metagraphs (2017)
  17. Jagabathula, Srikanth; Subramanian, Lakshminarayanan; Venkataraman, Ashwin: Identifying unreliable and adversarial workers in crowdsourced labeling tasks (2017)
  18. Leon Thurner, Alexander Scheidler, Florian Schaefer, Jan-Hendrik Menke, Julian Dollichon, Friederike Meier, Steffen Meinecke, Martin Braun: Pandapower - an Open Source Python Tool for Convenient Modeling, Analysis and Optimization of Electric Power Systems (2017) arXiv
  19. Loke, T.; Tang, J. W.; Rodriguez, J.; Small, M.; Wang, J. B.: Comparing classical and quantum pageranks (2017)
  20. Vasile, Cristian-Ioan; Aksaray, Derya; Belta, Calin: Time window temporal logic (2017)

1 2 3 next