Fully dynamic transitive closure: Breaking through the O(n2) barrier

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2000, Pages 381-389

  Demetrescu, Camil ^a   Italiano, Giuseppe F ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATRIX ALGEBRA; POLYNOMIALS; THEOREM PROVING;

FULLY DYNAMIC TRANSITIVE CLOSURE;

GRAPH THEORY;

EID: 0034497115     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)