Cited in
(only showing first 100 items - show all)- Unimodular lattice triangulations as small-world and scale-free random graphs
- New solutions for disjoint paths in P systems
- A note on the interpretation of the efficiency centrality
- Quantum solutions for densest \(k\)-subgraph problems
- Classical symmetries and the quantum approximate optimization algorithm
- Least resolved trees for two-colored best match graphs
- Extended Graph Formulation for the Inequity Aversion Pricing Problem on Social Networks
- PETSc DMNetwork: a library for scalable network PDE-based multiphysics simulations
- Enumeration of planar Tangles
- pyvine: the Python package for regular vine copula modeling, sampling and testing
- The first open channel for yield-stress fluids in porous media
- Topological graph persistence
- SIR dynamics with vaccination in a large configuration model
- Numerical simulations on nonlinear quantum graphs with the GraFiDi library
- Rigid graph compression: motif-based rigidity analysis for disordered fiber networks
- A survey of computational methods in protein-protein interaction networks
- Discrete Newton methods for the evacuation problem
- Higher-dimensional cluster combinatorics and representation theory
- Time series adjustment enhancement of hierarchical modeling of \textit{Arabidopsis thaliana} gene interactions
- On the emergence of large clusters of acoustic power sources at the onset of thermoacoustic instability in a turbulent combustor
- Cellular morphogenesis of three-dimensional tensegrity structures
- Efficient methods for the distance-based critical node detection problem in complex networks
- Kernel-based models for influence maximization on graphs based on Gaussian process variance minimization
- A compartmental model for cyber-epidemics
- Dissecting the square into seven or nine congruent parts
- Optimal TSP tour length estimation using Sammon maps
- Optimizing adiabatic quantum program compilation using a graph-theoretic framework
- On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs
- On the maximum small-world subgraph problem
- QUBO formulation for the contact map overlap problem
- Neighborhood discovery via network community structure
- Game of thieves and WERW-Kpath: two novel measures of node and edge centrality for mafia networks
- Trinajstić index
- Unified functional network and nonlinear time series analysis for complex systems science: the pyunicorn package
- Composite centrality: a natural scale for complex evolving networks
- Conedy: A scientific tool to investigate complex network dynamics
- Algorithmic expedients for the \(S\)-labeling problem
- A Python hands-on tutorial on network and topological neuroscience
- Chaotic traversal (CHAT): very large graphs traversal using chaotic dynamics
- A network-patch methodology for adapting agent-based models for directly transmitted disease to mosquito-borne disease
- A FastMap-based algorithm for block modeling
- Good and bad predictions: assessing and improving the replication of chaotic attractors by means of reservoir computing
- Multilevel spectral coarsening for graph Laplacian problems with application to reservoir simulation
- Towards objective measures of algorithm performance across instance space
- Intruder alert! Optimization models for solving the mobile robot graph-clear problem
- Towards Efficient Verification of Systems with Dynamic Process Creation
- Improving variable orderings of approximate decision diagrams using reinforcement learning
- Effective graph classification based on topological and label attributes
- Modeling functional connectivity on empirical and randomized structural brain networks
- Computing scores of forwarding schemes in switched networks with probabilistic faults
- Isolation branching: a branch and bound algorithm for the \(k \)-terminal cut problem
- Robust system size reduction of discrete fracture networks: a multi-fidelity method that preserves transport characteristics
- An abstraction-refinement methodology for reasoning about network games
- Alternative evaluation functions for the cyclic bandwidth sum problem
- Rigidity percolation in disordered 3D rod systems
- Organization mining using online social networks
- Integer linear programming formulations for double Roman domination problem
- Strong matching preclusion for augmented cubes
- Analysis of the football transfer market network
- Machine learning for graph-based representations of three-dimensional discrete fracture networks
- Opinions and networks: how do they effect each other
- Statistical analysis of the first passage path ensemble of jump processes
- Moments of the inverse participation ratio for the Laplacian on finite regular graphs
- Structural interpretation of sparse fault data using graph theory and geological rules. Fault data interpretation
- Constructing non-isomorphic signless Laplacian cospectral graphs
- Embedding-based silhouette community detection
- Generalized network measures based on modulus of families of walks
- Spectral properties of unimodular lattice triangulations
- A branch-price-and-cut algorithm for packing cuts in undirected graphs
- Comparing classical and quantum pageranks
- Strong local diagnosability of (n,k)-star graphs and Cayley graphs generated by 2-trees with missing edges
- Topological transition in a coupled dynamics in random networks
- An experimental study on the ply number of straight-line drawings
- Median approximations for genomes modeled as matrices
- Distance geometry and data science
- From symmetry to asymmetry: generalizing TSP approximations by parametrization
- Resource allocation for contingency planning: an inexact proximal bundle method for stochastic optimization
- Augmenting the algebraic connectivity for certain families of graphs
- Using inverse optimization to learn cost functions in generalized Nash games
- An analysis of the parameterized complexity of periodic timetabling
- Construction of cospectral graphs
- Improved formulations for minimum connectivity network interdiction problems
- Universal characteristics of deep neural network loss surfaces from random matrix theory
- Large-scale analysis of structural branching measures
- Finding colorful paths in temporal graphs
- QWalk
- TISEAN
- Graphviz
- GraphBase
- yFiles
- ANTLR
- Pajek
- OGDF
- Pajek datasets
- SNAP
- Helena
- GrInvIn
- LKH
- LEMON
- PIGALE
This page was built for software: NetworkX
