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:   Print 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


Primary Entity

<http://www.worldcat.org/oclc/34331562> # On diameter verification and boolean matrix multiplication
    a schema:Book, schema:CreativeWork ;
   library:oclcnum "34331562" ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/39784318#Place/stanford_calif> ; # Stanford, Calif.
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/cau> ;
   schema:about <http://id.worldcat.org/fast/804924> ; # Algebra, Boolean
   schema:about <http://id.worldcat.org/fast/805020> ; # Algorithms
   schema:bookFormat bgn:PrintBook ;
   schema:contributor <http://experiment.worldcat.org/entity/work/data/39784318#Organization/stanford_university_computer_science_department> ; # Stanford University. Computer Science Department.
   schema:contributor <http://experiment.worldcat.org/entity/work/data/39784318#Person/khanna_sanjeev> ; # Sanjeev Khanna
   schema:contributor <http://experiment.worldcat.org/entity/work/data/39784318#Person/motwani_rajeev> ; # Rajeev Motwani
   schema:creator <http://viaf.org/viaf/208032948> ; # Julien Basch
   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:isPartOf <http://experiment.worldcat.org/entity/work/data/39784318#Series/report_stanford_university_dept_of_computer_science> ; # Report / Stanford University, Dept. of Computer Science ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/39784318#Series/report_stanford_university_computer_science_department> ; # Report (Stanford University. Computer Science Department) ;
   schema:name "On diameter verification and boolean matrix multiplication"@en ;
   schema:productID "34331562" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/34331562#PublicationEvent/stanford_calif_stanford_university_dept_of_computer_science_1995> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/39784318#Agent/stanford_university_dept_of_computer_science> ; # Stanford University, Dept. of Computer Science
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/34331562> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/39784318#Agent/stanford_university_dept_of_computer_science> # Stanford University, Dept. of Computer Science
    a bgn:Agent ;
   schema:name "Stanford University, Dept. of Computer Science" ;
    .

<http://experiment.worldcat.org/entity/work/data/39784318#Organization/stanford_university_computer_science_department> # Stanford University. Computer Science Department.
    a schema:Organization ;
   schema:name "Stanford University. Computer Science Department." ;
    .

<http://experiment.worldcat.org/entity/work/data/39784318#Person/khanna_sanjeev> # Sanjeev Khanna
    a schema:Person ;
   schema:familyName "Khanna" ;
   schema:givenName "Sanjeev" ;
   schema:name "Sanjeev Khanna" ;
    .

<http://experiment.worldcat.org/entity/work/data/39784318#Person/motwani_rajeev> # Rajeev Motwani
    a schema:Person ;
   schema:familyName "Motwani" ;
   schema:givenName "Rajeev" ;
   schema:name "Rajeev Motwani" ;
    .

<http://experiment.worldcat.org/entity/work/data/39784318#Place/stanford_calif> # Stanford, Calif.
    a schema:Place ;
   schema:name "Stanford, Calif." ;
    .

<http://experiment.worldcat.org/entity/work/data/39784318#Series/report_stanford_university_computer_science_department> # Report (Stanford University. Computer Science Department) ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/34331562> ; # On diameter verification and boolean matrix multiplication
   schema:name "Report (Stanford University. Computer Science Department) ;" ;
    .

<http://experiment.worldcat.org/entity/work/data/39784318#Series/report_stanford_university_dept_of_computer_science> # Report / Stanford University, Dept. of Computer Science ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/34331562> ; # On diameter verification and boolean matrix multiplication
   schema:name "Report / Stanford University, Dept. of Computer Science ;" ;
    .

<http://id.worldcat.org/fast/804924> # Algebra, Boolean
    a schema:Intangible ;
   schema:name "Algebra, Boolean"@en ;
    .

<http://id.worldcat.org/fast/805020> # Algorithms
    a schema:Intangible ;
   schema:name "Algorithms"@en ;
    .

<http://viaf.org/viaf/208032948> # Julien Basch
    a schema:Person ;
   schema:familyName "Basch" ;
   schema:givenName "Julien" ;
   schema:name "Julien Basch" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

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