scientific article; zbMATH DE number 7267631

zbMath1445.68342MaRDI QIDQ5128542

Vladislav Haralampiev

Publication date: 27 October 2020

Full work available at URL: http://serdica-comp.math.bas.bg/index.php/serdicajcomputing/article/view/334

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

randomized algorithmgraph connectivity3-edge connected components

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Unnamed Item
• Maintenance of 2- and 3-edge-connected components of graphs. I
• A linear time algorithm for computing 3-edge-connected components in a multigraph
• PERFECT STOCHASTIC SUMMATION IN HIGH ORDER FEYNMAN GRAPH EXPANSIONS
• The Cluster Editing Problem: Implementations and Experiments
• Fast Distributed Computation of Cuts Via Random Circulations
• Dividing a Graph into Triconnected Components

This page was built for publication: