Maximal k-Edge-Connected Subgraphs in Weighted Graphs via Local Random Contraction

Nalam, Chaitanya; Saranurak, Thatchaphol

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.

+ Advanced Search

Citation Details

Maximal k-Edge-Connected Subgraphs in Weighted Graphs via Local Random Contraction

Award ID(s):: 2238138

PAR ID:: 10536498

Author(s) / Creator(s):: Nalam, Chaitanya; Saranurak, Thatchaphol

Publisher / Repository:: SIAM

Date Published:: 2024-01-22

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
This content will become publicly available on January 22, 2025
Conference Paper:
The DOI is not currently available.

Last Name:

First Name:

Search Results
Selected Authors

Type in a name, or the first few letters of a name, in one or both of appropriate search boxes above and select the search button. An attempt will be made to match authors that most closely relate to the text you typed.

No authors are currently selected. Choosing "Select These Authors" will enter a blank value for author search in the parent form.

Last Name:

First Name:

Search Results
Selected Editors

Type in a name, or the first few letters of a name, in one or both of appropriate search boxes above and select the search button. An attempt will be made to match editors that most closely relate to the text you typed.

No editors are currently selected. Choosing "Select These Editors" will enter a blank value for editor search in the parent form.

More Like this