Approximation algorithms for cycle packing problems | NobleID

Main

Mint Work Search Explore Works Knowledge Graph Citation Graph Bibliometrics Receipts

v1

Approximation algorithms for cycle packing problems

NobleID: NI8P40W50R33S93
Persistent link: https://nobleid.org/ark:/48914/w1/20260515/30AD78CF

Type:Journal Article

0 views

Support unavailableClaim Your Authorship

Embeddable Badge

[![NobleID](https://www.nobleid.org/api/badge/30AD78CF.svg?ark=w1%2F20260515%2F30AD78CF&value=id)](https://nobleid.org/work/w1/20260515/30AD78CF)

ARK Inflections

Metadata Policy

Metadata Formats

Bibliometric Analysis

Impact metrics, research fronts, co-authorship networks →

Authors & Claims

Paper Authors

Michael Krivelevich

Claim authorship of this work

info@nobleid.org

About FAQ Terms Policy Persistence & Resolver Service Policy