NetworkX

swMATH616WikidataQ7000696 ScholiaQ7000696MaRDI QIDQ13371FDOQ13371

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• New solutions for disjoint paths in P systems
• Enumeration of planar Tangles
• pyvine: the Python package for regular vine copula modeling, sampling and testing
• Numerical simulations on nonlinear quantum graphs with the GraFiDi library
• Topological graph persistence
• SIR dynamics with vaccination in a large configuration model
• Higher-dimensional cluster combinatorics and representation theory
• Cellular morphogenesis of three-dimensional tensegrity structures
• Efficient methods for the distance-based critical node detection problem in complex networks
• Optimal TSP tour length estimation using Sammon maps
• Optimizing adiabatic quantum program compilation using a graph-theoretic framework
• On the maximum small-world subgraph problem
• Conedy: A scientific tool to investigate complex network dynamics
• A FastMap-based algorithm for block modeling
• Towards Efficient Verification of Systems with Dynamic Process Creation
• Intruder alert! Optimization models for solving the mobile robot graph-clear problem
• Towards objective measures of algorithm performance across instance space
• Effective graph classification based on topological and label attributes
• 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
• Machine learning for graph-based representations of three-dimensional discrete fracture networks
• Strong matching preclusion for augmented cubes
• Opinions and networks: how do they effect each other
• Comparing classical and quantum pageranks
• Generalized network measures based on modulus of families of walks
• Spectral properties of unimodular lattice triangulations
• Strong local diagnosability of \((n,k)\)-star graphs and Cayley graphs generated by 2-trees with missing edges
• Distance geometry and data science
• Median approximations for genomes modeled as matrices
• Augmenting the algebraic connectivity for certain families of graphs
• Construction of cospectral graphs
• An analysis of the parameterized complexity of periodic timetabling
• Improved formulations for minimum connectivity network interdiction problems
• Efficiently and easily integrating differential equations with JiTCODE, JiTCDDE, and JiTCSDE
• DisCoPy: Monoidal Categories in Python
• Large-scale analysis of structural branching measures
• Exact and heuristic algorithms for the weighted total domination problem
• JGraphT—A Java Library for Graph Data Structures and Algorithms
• Data mining of social networks represented as graphs
• Computational approaches for zero forcing and related problems
• A topological insight into restricted Boltzmann machines
• A polyhedral approach to least cost influence maximization in social networks
• Modeling complex systems with adaptive networks
• On exact solution approaches for the longest induced path problem
• An integer programming approach for finding the most and the least central cliques
• A polyhedral study of the maximum edge subgraph problem
• PETSc DMNetwork
• Computing heat kernel PageRank and a local clustering algorithm
• Title not available (Why is that?)
• Clustering of high throughput gene expression data
• Finding outbreak trees in networks with limited information
• Attractor stability in finite asynchronous biological system models
• Integer sequence discovery from small graphs
• Ranking robustness and its application to evacuation planning
• A multivariate extreme value theory approach to anomaly clustering and visualization
• Generating bipartite networks with a prescribed joint degree distribution
• Effect of human behavior on the evolution of viral strains during an epidemic
• Models of simply-connected trivalent 2-dimensional stratifolds
• PySAT: a Python toolkit for prototyping with SAT oracles
• Reactive and dynamic local search for max-clique: engineering effective building blocks
• Integer programming approach to static monopolies in graphs
• Measuring the robustness of a network using minimal vertex covers
• LNetReduce: tool for reducing linear dynamic networks with separated timescales
• Learning to sparsify travelling salesman problem instances
• A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs
• A hybrid adjacency and time-based data structure for analysis of temporal networks
• K-plex cover pooling for graph neural networks
• Direct superbubble detection
• Unimodular lattice triangulations as small-world and scale-free random graphs
• A note on the interpretation of the efficiency centrality
• Least resolved trees for two-colored best match graphs
• Extended Graph Formulation for the Inequity Aversion Pricing Problem on Social Networks
• Quantum solutions for densest \(k\)-subgraph problems
• Classical symmetries and the quantum approximate optimization algorithm
• The first open channel for yield-stress fluids in porous media
• A survey of computational methods in protein-protein interaction networks
• Discrete Newton methods for the evacuation problem
• On the emergence of large clusters of acoustic power sources at the onset of thermoacoustic instability in a turbulent combustor
• 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
• On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs
• QUBO formulation for the contact map overlap problem
• An Experimental Study on the Ply Number of Straight-line Drawings
• Composite centrality: a natural scale for complex evolving networks
• Algorithmic expedients for the \(S\)-labeling problem
• A Python hands-on tutorial on network and topological neuroscience
• A network-patch methodology for adapting agent-based models for directly transmitted disease to mosquito-borne disease
• Identifying Backbones in Three-Dimensional Discrete Fracture Networks: A Bipartite Graph-Based Approach
• ordpy: A Python package for data analysis with permutation entropy and ordinal network methods
• Modeling functional connectivity on empirical and randomized structural brain networks
• Core–periphery structure in directed networks
• Organization mining using online social networks
• Moments of the inverse participation ratio for the Laplacian on finite regular graphs
• Analysis of the football transfer market network
• Algebraic Algorithms for Betweenness and Percolation Centrality
• Statistical analysis of the first passage path ensemble of jump processes
• Structural interpretation of sparse fault data using graph theory and geological rules. Fault data interpretation

This page was built for software: NetworkX