skip to content
On diameter verification and boolean matrix multiplication Preview this item
ClosePreview this item
Checking...

On diameter verification and boolean matrix multiplication

Author: Julien Basch; Sanjeev Khanna; Rajeev Motwani; Stanford University. Computer Science Department.
Publisher: Stanford, Calif. : Stanford University, Dept. of Computer Science, [1995]
Series: Report (Stanford University. Computer Science Department), STAN- CS-TR-95-1544.
Edition/Format:   Book : English
Database:WorldCat
Summary:
Abstract: "We present a practical algorithm that verifies whether a graph has diameter 2 in time O (n³/log²n). A slight adaptation of this algorithm yields a boolean matrix multiplication algorithm which runs in the same time bound; thereby allowing us to compute transitive closure and verification of the diameter of a graph for any constant d in O (n³/log²n) time.
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Julien Basch; Sanjeev Khanna; Rajeev Motwani; Stanford University. Computer Science Department.
OCLC Number: 34331562
Notes: Cover title.
"February 1995."
Description: 4 pages ; 28 cm.
Series Title: Report (Stanford University. Computer Science Department), STAN- CS-TR-95-1544.
Responsibility: by Julien Basch, Sanjeev Khanna and and [sic] Rajeev Motwani.

Abstract:

Abstract: "We present a practical algorithm that verifies whether a graph has diameter 2 in time O (n³/log²n). A slight adaptation of this algorithm yields a boolean matrix multiplication algorithm which runs in the same time bound; thereby allowing us to compute transitive closure and verification of the diameter of a graph for any constant d in O (n³/log²n) time.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(2)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/34331562>
library:oclcnum"34331562"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/34331562>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
<http://viaf.org/viaf/239748731>
rdf:typeschema:Organization
schema:name"Stanford University. Computer Science Department."
schema:contributor
schema:creator
schema:datePublished"1995"
schema:description"Abstract: "We present a practical algorithm that verifies whether a graph has diameter 2 in time O (n³/log²n). A slight adaptation of this algorithm yields a boolean matrix multiplication algorithm which runs in the same time bound; thereby allowing us to compute transitive closure and verification of the diameter of a graph for any constant d in O (n³/log²n) time."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/39784318>
schema:inLanguage"en"
schema:name"On diameter verification and boolean matrix multiplication"@en
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.