A note on the complexity of longest path problems related to graph coloring 2004 (English)In: Applied Mathematics Letters, ISSN 0893-9659, E-ISSN 1873-5452, Vol. 17, no 1, p. 13-15Article in journal (Refereed) Published

Abstract [en]

In this note, we show that some problems related to the length of the longest simple path from a given vertex in a graph are NP-complete. We also discuss an extension to the graph coloring problem

Place, publisher, year, edition, pages

2004. Vol. 17, no 1, p. 13-15

National Category

Production Engineering, Human Work Science and Ergonomics

Research subject

Industrial Logistics

Identifiers

URN: urn:nbn:se:ltu:diva-6246DOI: 10.1016/S0893-9659(04)90003-1ISI: 000188398400003Scopus ID: 2-s2.0-0942300285Local ID: 47285eff-c1f9-4dd3-b8f1-d42145e870c4OAI: oai:DiVA.org:ltu-6246DiVA, id: diva2:979123

Note

Upprättat; 2004; 20140925 (andbra)Available from: 2016-09-29 Created: 2016-09-29 Last updated: 2023-05-08Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Migdalas, Athanasios

Search in DiVA

By author/editor

Migdalas, Athanasios

In the same journal

Applied Mathematics Letters

On the subject

Production Engineering, Human Work Science and Ergonomics

Search outside of DiVA

GoogleGoogle ScholarTotal: 24 hits