Imagen de Portada

Characterizing Flow Complexity in Transportation Networks using Graph Homology

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Deshpande, Shashank A, Balakrishnan, Hamsa
Formato:	Preprint
Publicado:	2024
Materias:	Systems and Control Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Method for Constructing Wavelet Functions on the Real Number Field
por: Li, Ning, et al.
Publicado: (2024)

Brute-force search and Warshall algorithms for matrix-weighted graphs
por: Trinh, Minh Hoang, et al.
Publicado: (2025)

Infinite precedence graphs for consistency verification in P-time event graphs
por: Zorzenon, Davide, et al.
Publicado: (2025)

Weak consistency of P-time event graphs
por: Zorzenon, Davide, et al.
Publicado: (2022)

Switched max-plus linear-dual inequalities: cycle time analysis and applications
por: Zorzenon, Davide, et al.
Publicado: (2023)

Online Algorithm for Node Feature Forecasting in Temporal Graphs
por: Rahman, Aniq Ur, et al.
Publicado: (2024)

Economic Dispatch of a Single Micro-Gas Turbine Under CHP Operation with Uncertain Demands
por: Sharf, Miel, et al.
Publicado: (2021)

Topological Graph Simplification Solutions to the Street Intersection Miscount Problem
por: Boeing, Geoff
Publicado: (2024)

Analysis and Mitigation of Cascading Failures Using a Stochastic Interaction Graph with Eigen-analysis
por: Guo, Zhenping, et al.
Publicado: (2025)

Real-time Optimization of Transport Chains for Single Wagon Load Railway Transport
por: Moldenhauer, Carsten, et al.
Publicado: (2025)

Cluster Assignment in Multi-Agent Systems
por: Sharf, Miel, et al.
Publicado: (2022)

Valid Cuts for the Design of Potential-based Flow Networks
por: Börner, Pascal, et al.
Publicado: (2025)

Shortest Paths in Graphs of Convex Sets
por: Marcucci, Tobia, et al.
Publicado: (2021)

Data-Driven Nonlinear Regulation: Gaussian Process Learning
por: Harry, Telema, et al.
Publicado: (2025)

Efficient Sparse Flow Decomposition Methods for RNA Multi-Assembly
por: Besançon, Mathieu
Publicado: (2025)

Integer Traffic Assignment Problem: Algorithms and Insights on Random Graphs
por: Harfouche, Rayan, et al.
Publicado: (2024)

Fixed Point Certificates for Reachability and Expected Rewards in MDPs
por: Chatterjee, Krishnendu, et al.
Publicado: (2025)

Consistency of P-time event graphs is decidable in polynomial time (extended version)
por: Zorzenon, Davide, et al.
Publicado: (2023)

Highly Connected Graph Partitioning: Exact Formulation and Solution Methods
por: Swamy, Rahul, et al.
Publicado: (2024)

Periodic trajectories in P-time event graphs and the non-positive circuit weight problem
por: Zorzenon, Davide, et al.
Publicado: (2021)

On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method
por: Tellache, Nour ElHouda, et al.
Publicado: (2025)

On the Virtual Network Embedding polytope
por: Benhamiche, Amal, et al.
Publicado: (2026)

On Rank-Monotone Graph Operations and Minimal Obstruction Graphs for the Lovász--Schrijver SDP Hierarchy
por: Au, Yu Hin, et al.
Publicado: (2024)

A Bilevel Integer Programming Approach for the Synchronous Attractor Control Problem
por: Moon, Kyungduk, et al.
Publicado: (2026)

Decomposition and factorisation of transients in Functional Graphs
por: Doré, François, et al.
Publicado: (2022)

On the Performance of Linear Adaptive Filters driven by the Ergodic Chaotic Logistic Map
por: Mueller, Andreas
Publicado: (2025)

Geometry of the Reformulation-Linearization-Technique: Domination of Disjunctions
por: Hof, Hugo A., et al.
Publicado: (2025)

Constrained Shortest-Path Reformulations via Decision Diagrams for Structured Two-stage Optimization Problems
por: Lozano, Leonardo, et al.
Publicado: (2022)

Model Discovery and Graph Simulation: A Lightweight Gateway to Chaos Engineering
por: Krasnovsky, Anatoly A.
Publicado: (2025)

Two-person Positive Shortest Path Games Have Nash Equilibria in Pure Stationary Strategies
por: Boros, Endre, et al.
Publicado: (2024)

On the Computational Complexity of Multi-Objective Ordinal Unconstrained Combinatorial Optimization
por: Figueira, José Rui, et al.
Publicado: (2024)

Characterization of Word-Representable Graphs using Modular Decomposition
por: Dwary, Tithi, et al.
Publicado: (2024)

$O(p \log d)$ Subgraph Isomorphism using Stigmergic Swarming Agents
por: Parunak, H. Van Dyke
Publicado: (2025)

Multilevel Facility Location Optimization: A Novel Integer Programming Formulation and Approaches to Heuristic Solutions
por: Alidaee, Bahram, et al.
Publicado: (2024)

Lower bounds for the integrality gap of the bi-directed cut formulation of the Steiner Tree Problem
por: Bernardelli, Ambrogio Maria, et al.
Publicado: (2024)

Order acceptance and scheduling in capacitated job shops
por: Linß, Florian, et al.
Publicado: (2024)

Market proliferation and the impact of locational complexity on network restructuring
por: Pinar-Pérez, J. M., et al.
Publicado: (2024)

Factorized binary polynomial optimization
por: Del Pia, Alberto
Publicado: (2024)

Chorded cycle facets of the clique partitioning polytope
por: Irmai, Jannik, et al.
Publicado: (2024)

Beyond hypergraph acyclicity: limits of tractability for pseudo-Boolean optimization
por: Del Pia, Alberto, et al.
Publicado: (2024)