A Linear Algorithm for Finding the Invariant Edges of an Edge-Weighted Graph
From MaRDI portal
Publication:3149876
DOI10.1137/S0097539700376068zbMath1001.05037MaRDI 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
68R10: Graph theory (including graph drawing) in computer science
05B35: Combinatorial aspects of matroids and geometric lattices
62Q05: Statistical tables
05C85: Graph algorithms (graph-theoretic aspects)
15A03: Vector spaces, linear dependence, rank, lineability
Related Items
An analytical approach to the inference of summary data of additive type, Minimal invariant sets in a vertex-weighted graph