An On-line Competitive Algorithm for Coloring Bipartite Graphs Without Long Induced Paths

Tytuł:
An On-line Competitive Algorithm for Coloring Bipartite Graphs Without Long Induced Paths
Czasopismo:
Algorithmica
Rok:
2017

Strony:
1060-1070

Tom (seria wydawnicza):
77

Numer DOI:
10.1007/s00453-016-0130-2

Link:
https://link.springer.com/article/10.1007/s00453-016-0130-2