Sparse certificates and removable cycles in l-mixed p-connected graphs

Authors:
Alex R. Berg;Tibor JordáN
Affiliations:
Basic Research in Computer Science, (BRICS) University of Aarhus, Aabogade 34, 8200 Aarhus N, Denmark;Department of Operations Research, Eötvös University, Pázmány sétány 1/C, 1117 Budapest, Hungary
Venue:
Operations Research Letters
Year:
2005

Citing 6
Cited 2

Scan-first search and sparse certificates: an improved parallel algorithm for k-vertex connectivity

SIAM Journal on Computing
On sparse subgraphs preserving connectivity properties

Journal of Graph Theory
Connectivity and network flows

Handbook of combinatorics (vol. 1)
On mixed connectivity certificates

ESA '95 Selected papers from the third European symposium on Algorithms
On minimally (n, &lgr;)-connected graphs

Journal of Combinatorial Theory Series B
Graph connectivity and its augmentation: applications of MA orderings

Discrete Applied Mathematics

Sparse connectivity certificates via MA orderings in graphs

Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Note: A sufficient connectivity condition for generic rigidity in the plane

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

A graph G=(V,E) is called l-mixed p-connected if G-S-L is connected for all pairs S,L with S@?V, L@?E, and l|S|+|L|=m, p=m). We show how to use maximum adjacency orderings to find sparse certificates and removable cycles in l-mixed p-connected graphs in linear time.