undefined

< Back to search results

An Optimal O(nm) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph

Year of publication

2019

Authors

Cairo, Massimo; Medvedev, Paul; Acosta, Nidia Obscura; Rizzi, Romeo; Tomescu, Alexandru I.

Organizations and authors

Aalto University

Acosta Nidia Orcid -palvelun logo

University of Helsinki

Tomescu Alexandru I.

Publication type

Publication format

Article

Parent publication type

Journal

Article type

Original article

Audience

Scientific

Peer-reviewed

Peer-Reviewed

MINEDU's publication type classification code

A1 Journal article (refereed), original research

Publication channel information

Journal/Series

ACM transactions on algorithms

Parent publication name

ACM Transactions on Algorithms

Publisher

ACM

Volume

15

Issue

4

Article number

48

Pages

1-17

ISSN

1549-6325

​Publication forum

50128

​Publication forum level

3

Open access

Open access in the publisher’s service

Yes

Open access of publication channel

Partially open publication channel

Self-archived

Yes

Other information

Fields of science

Mathematics; Computer and information sciences

Keywords

[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Internationality of the publisher

International

Language

English

International co-publication

Yes

Co-publication with a company

No

DOI

10.1145/3341731

The publication is included in the Ministry of Education and Culture’s Publication data collection

Yes