Computing and Combinatorics

DOI10.1007/11533719zbMath1128.68398OpenAlexW4376561447MaRDI QIDQ5716992

Stefan Langerman, Eythan Levy, Martine Labbé, Hadrien Mélot, Jean Cardinal

Publication date: 11 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11533719

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (11)

Minimum maximal matchings in cubic graphs ⋮ Why Locally-Fair Maximal Flows in Client-Server Networks Perform Well ⋮ Why locally-fair maximal flows in client-server networks perform well ⋮ Connected Vertex Covers in Dense Graphs ⋮ Bounding and approximating minimum maximal matchings in regular graphs ⋮ Facet defining inequalities among graph invariants: The system graphedron ⋮ Approximating Edge Dominating Set in Dense Graphs ⋮ Integer programming formulations for the minimum weighted maximal matching problem ⋮ Connected vertex covers in dense graphs ⋮ Improved approximation bounds for edge dominating set in dense graphs ⋮ Approximating edge dominating set in dense graphs

This page was built for publication: Computing and Combinatorics