Counting Minimum Cost Bounded Degree Subtrees in Graphs with Small 2-Vertex-Connected Components

The author's participation in multiple algorithmic contests (both as a contestant and as a member of the scientific committee) influenced many of the results presented in this paper. The attached ZIP archive contains a few sample tasks and solutions (of the author or of others) which are related to some of the algorithms presented in this paper.

Data and Resources

Counting Minimum Cost Bounded Degree Subtrees...HTML
Explore
- More information
- Go to resource

Additional Info

Field	Value
Source	The Annals of "Dunarea de Jos" University of Galati, Fascicle III: Electrotechnics, Electronics, Automatic Control and Informatics (ISSN: 1221-454X)
Author	Andreica, Mugurel Ionut
Maintainer	CCSD
Last Updated	May 7, 2026, 17:02 (UTC)
Created	May 7, 2026, 17:02 (UTC)
Identifier	hal-00922183
Language	en
Rights	https://about.hal.science/hal-authorisation-v1/
contributor	Parallel and Distributed Systems Laboratory [Bucarest] ; Polytechnic University of Bucharest [Romania] = Université Politehnica de Bucarest [Roumanie] = Universitatea Națională de Știință și Tehnologie Politehnica București [România] (UPB)
creator	Andreica, Mugurel Ionut
date	2013-12-02T00:00:00
harvest_object_id	3a998ef6-e0f4-4012-a5c1-4f7aace910f5
harvest_source_id	3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title	test moissonnage SELUNE
metadata_modified	2025-01-14T00:00:00
set_spec	type:ART