On finding rainbow and colorful paths

descriptionPublicationkeyboard_double_arrow_right Article 01 May 2016 English Publisher:Elsevier BVJournal:Theoretical Computer Science, volume 628, pages 110-114 (issn: 0304-3975,

Copyright policy )

Authors: Lukasz Kowalik; Juho Lauri;

doi: 10.1016/j.tcs.2016.03.017

On finding rainbow and colorful paths

- Summary
- Subjects
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Organizations

Keywords

graph algorithms, Connectivity, Coloring of graphs and hypergraphs, computational complexity, colorful path, Analysis of algorithms and problem complexity, Graph algorithms (graph-theoretic aspects), rainbow connectivity

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	10
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average