English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Detecting Directed 4-cycles Still Faster

Eisenbrand, F., & Grandoni, F. (2003). Detecting Directed 4-cycles Still Faster. Information Processing Letters, 87, 13-15.

Item is

Files

show Files
hide Files
:
cicle.ps (Publisher version), 70KB
 
File Permalink:
-
Name:
cicle.ps
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/postscript
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Eisenbrand, Friedrich1, Author           
Grandoni, Fabrizio1, Author           
Affiliations:
1Discrete Optimization, MPI for Informatics, Max Planck Society, ou_1116548              

Content

show
hide
Free keywords: -
 Abstract: We present a method to detect simple cycles of length~4 of a directed graph in~$O(n^{1/\omega} e^{2-2/\omega})$ steps, where $n$~denotes the number of nodes, $e$ denotes the number of edges and $\omega$ is the exponent of matrix multiplication. This improves upon the currently fastest methods for $\alpha\in (2/(4-\omega),(\omega+1)/2)$, where $e=n^\alpha$.

Details

show
hide
Language(s): eng - English
 Dates: 2004-07-012003
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 202036
Other: Local-ID: C1256BDD00205AD6-887E6EBB78997E70C1256CD800369B3A-EisGra2003
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Information Processing Letters
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: Amsterdam : Elsevier
Pages: - Volume / Issue: 87 Sequence Number: - Start / End Page: 13 - 15 Identifier: ISSN: 0020-0190
CoNE: https://pure.mpg.de/cone/journals/resource/954921346222