Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

problema del cammino massimo · Vinony

Home
Computational problems in graph theory
problema del cammino massimo

🌐Italiano

English Deutsch Español Français Italiano Português Русский فارسی ไทย 中文

EntityQ2916352· pop 14· linked from 30 articles

problema del cammino massimo

the problem of finding a simple path of maximum length in a given graph

Available in 14 languages

Español
Français
Deutsch
中文
Русский
Português
Armenian
Catalan
Hebrew

Connections

time complexity

topological sorting

Categories

Computational problems in graph theory Graph algorithms Graph distance Hamiltonian paths and cycles Network theory NP-complete problems

Sources

wikipedia.externallinksexternallink

via Wikidata sitelinks · CC0

International Standard Book Number

Entity

digital object identifier

Edsger W. Dijkstra

theoretical computer science

dynamic programming

P versus NP problem

depth-first search

travelling salesperson problem

Sign in to save

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

maximum independent set problem

Entitydist 0.47

Dibrugarh-Kanyakumari Vivek Express

Entitydist 0.56

degree diameter problem

Entitydist 0.58

Entitydist 0.59

critical path method

Entitydist 0.62

Entitydist 0.65

Entitydist 0.66

Steiner tree problem

Entitydist 0.67

knapsack problem

Entitydist 0.67

Entitydist 0.67

Entitydist 0.68

Minimum en route altitude

Entitydist 0.68

What links here30 pages

Optimal substructure

glossary of graph theory terms

directed acyclic graph

Dijkstra's algorithm

hypercube graph

transitive reduction

critical path method

Science Fell in Love, So I Tried to Prove It

topological sorting

shortest path problem