Title of article
A note on computing graph closures Original Research Article
Author/Authors
Jeremy P. Spinrad، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
3
From page
327
To page
329
Abstract
This note shows that the k-closure of a graph can be computed in time proportional to the size of the output, improving on previous O(n3) algorithms.
Keywords
Graph closure , Algorithm
Journal title
Discrete Mathematics
Serial Year
2004
Journal title
Discrete Mathematics
Record number
948782
Link To Document