On the difficulty of finding walks of length k

DOI10.1051/ita/1997310504291zbMath0893.68072OpenAlexW164847628MaRDI QIDQ4385673

F. Ravasio, Danilo Bruschi, Stefano Basagni

Publication date: 3 August 1998

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92570

zbMATH Keywords

computational complexitydirected graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

Methods for determining cycles of a specific length in undirected graphs with edge weights

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exact arborescences, matchings and cycles
• Random parallel algorithms for finding exact branchings, perfect matchings, and cycles
• Graphs, dynamic programming, and finite games
• The complexity of restricted spanning tree problems
• Random pseudo-polynomial algorithms for exact matroid problems
• Color-coding

This page was built for publication: On the difficulty of finding walks of length k