Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs

doi 10.1145/1993636.1993674
Full Text
Abstract

Available in full text

Date
Authors
Publisher

ACM Press

Related search

Approximate Maximum Flow on Separable Undirected Graphs

2013English

Computing Maximum Flow With Augmenting Electrical Flows

2016English

Time Varying Undirected Graphs

Machine Learning
Artificial IntelligenceSoftware
2010English

New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs

2020English

Faster Sublinear Approximation of the Number of K-Cliques in Low-Arboricity Graphs

2020English

On Maximum Signless Laplacian Estrada Index of Graphs With Given Parameters II

Electronic Journal of Graph Theory and Applications
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

Multi-Session Function Computation and Multicasting in Undirected Graphs

IEEE Journal on Selected Areas in Communications
Computer NetworksElectronic EngineeringElectricalCommunications
2013English

The Laplacian Spread of Graphs

Czechoslovak Mathematical Journal
Mathematics
2012English

An Approach to Determination of Maximal Cliques in Undirected Graphs

International Journal of Modern Education and Computer Science
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy