Reducing the adjacency matrix of a tree
Work
Year: 1996
Type: article
Abstract: Let T be a tree, A its adjacency matrix, and a scalar.We describe a linear-time algorithm for reducing the matrix In + A. Applications include computing the rank of A, nding a maximum matching in T, c... more
Cites: 11
Cited by: 28
Related to: 10
FWCI: 0.908
Citation percentile (by year/subfield): 88.45
Topic: Matrix Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze