A Linear Algorithm for Finding the Invariant Edges of an Edge-Weighted Graph

DOI10.1137/S0097539700376068zbMath1001.05037OpenAlexW2006344679MaRDI QIDQ3149876

Mauro Mezzini, Francesco Mario Malvestuto

Publication date: 29 September 2002

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539700376068

zbMATH Keywords

graph algorithmslinear algebramatroid theory

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial aspects of matroids and geometric lattices (05B35) Statistical tables (62Q05) Graph algorithms (graph-theoretic aspects) (05C85) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items (2)

An analytical approach to the inference of summary data of additive type ⋮ Minimal invariant sets in a vertex-weighted graph

This page was built for publication: A Linear Algorithm for Finding the Invariant Edges of an Edge-Weighted Graph