Imagen de Portada

iFlow: An Interactive Max-Flow/Min-Cut Algorithms Visualizer

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Ye, Muyang, Xia, Tianrui, Zu, Tianxin, Wang, Qian, Kempe, David
Formato:	Preprint
Publicado:	2024
Materias:	Human-Computer Interaction Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Teaching Algorithm Design: A Literature Review
por: Liu, Jonathan, et al.
Publicado: (2024)

Block-Based Pathfinding: A Minecraft System for Visualizing Graph Algorithms
por: Pirvu, Luca-Stefan, et al.
Publicado: (2026)

ENS-t-SNE: Embedding Neighborhoods Simultaneously t-SNE
por: Miller, Jacob, et al.
Publicado: (2022)

Deterministic Edge Connectivity and Max Flow using Subquadratic Cut Queries
por: Anand, Aditya, et al.
Publicado: (2024)

Min-Max Connected Multiway Cut
por: Tiwary, Hans Raj, et al.
Publicado: (2026)

Faster All-Pairs Minimum Cut: Bypassing Exact Max-Flow
por: Kenneth-Mordoch, Yotam, et al.
Publicado: (2025)

Faster Min-Cost Flow and Approximate Tree Decomposition on Bounded Treewidth Graphs
por: Dong, Sally, et al.
Publicado: (2023)

Parameterized Max Min Feedback Vertex Set
por: Lampis, Michael, et al.
Publicado: (2023)

Tight Lower Bounds for Directed Cut Sparsification and Distributed Min-Cut
por: Cheng, Yu, et al.
Publicado: (2024)

Streaming and Massively Parallel Algorithms for Euclidean Max-Cut
por: Menand, Nicolas, et al.
Publicado: (2025)

Max-Min Diversification with Asymmetric Distances
por: Kumpulainen, Iiro, et al.
Publicado: (2025)

Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality
por: Brand, Jan van den, et al.
Publicado: (2024)

On the Approximability of Train Routing and the Min-Max Disjoint Paths Problem
por: Bhaskar, Umang, et al.
Publicado: (2025)

Faster Algorithms for Fair Max-Min Diversification in $\mathbb{R}^d$
por: Kurkure, Yash, et al.
Publicado: (2024)

Partial Implementation of Max Flow and Min Cost Flow in Almost-Linear Time
por: Kavi, Nithin
Publicado: (2024)

Optimizing Feature Ordering in Radar Charts for Multi-Profile Comparison
por: Dorador, Albert
Publicado: (2025)

A tight quasi-polynomial bound for Global Label Min-Cut
por: Jaffke, Lars, et al.
Publicado: (2022)

Streaming Max-Cut in General Metrics
por: Jiang, Shaofeng H. -C., et al.
Publicado: (2025)

Submodular Max-Min Allocation under Identical Valuations
por: Boehmer, Kimon
Publicado: (2026)

Robust Multiagent Collaboration Through Weighted Max-Min T-Joins
por: Alipour, Sharareh
Publicado: (2026)

Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time
por: Jin, Wenyu, et al.
Publicado: (2024)

Local Max-Cut on Sparse Graphs
por: Schwartzman, Gregory
Publicado: (2023)

Max-Cut with Multiple Cardinality Constraints
por: Makarychev, Yury, et al.
Publicado: (2025)

The Min Max Average Cycle Weight Problem
por: Elmalem, Noga Klein, et al.
Publicado: (2025)

Efficient stream-based Max-Min diversification with minimal failure rate
por: Kalogeratos, Argyris, et al.
Publicado: (2020)

Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity
por: de Vos, Tijn, et al.
Publicado: (2024)

Faster Weak Expander Decompositions and Approximate Max Flow
por: Fleischmann, Henry, et al.
Publicado: (2025)

Superpolynomial smoothed complexity of 3-FLIP in Local Max-Cut
por: Michel, Lukas, et al.
Publicado: (2023)

Utilizing ChatGPT in a Data Structures and Algorithms Course: A Teaching Assistant's Perspective
por: Jamie, Pooriya, et al.
Publicado: (2024)

Max Cut with Small-Dimensional SDP Solutions
por: Chang, Hsien-Chih, et al.
Publicado: (2026)

Constrained Cuts, Flows, and Lattice-Linearity
por: Streit, Robert, et al.
Publicado: (2025)

Min-Max Correlation Clustering via Neighborhood Similarity
por: Cao, Nairen, et al.
Publicado: (2025)

A Tight Max-Flow Min-Cut Duality Theorem for Non-Linear Multicommodity Flows
por: Broussard, Matthew, et al.
Publicado: (2021)

Maximum-Flow and Minimum-Cut Sensitivity Oracles for Directed Graphs
por: Ahi, Mridul, et al.
Publicado: (2025)

Efficient Dynamic MaxFlow Computation on GPUs
por: Kannappan, Shruthi, et al.
Publicado: (2025)

Max-Cut with $ε$-Accurate Predictions
por: Cohen-Addad, Vincent, et al.
Publicado: (2024)

Pseudodeterministic Algorithms for Minimum Cut Problems
por: Agarwala, Aryan, et al.
Publicado: (2025)

(Almost) Ruling Out SETH Lower Bounds for All-Pairs Max-Flow
por: Trabelsi, Ohad
Publicado: (2023)

Improved Upper Bounds for the Directed Flow-Cut Gap
por: Bodwin, Greg, et al.
Publicado: (2026)

Multi-Pass Streaming Lower Bounds for Approximating Max-Cut
por: Fei, Yumou, et al.
Publicado: (2025)