ScienceGate
Advanced Search
Author Search
Journal Finder
Blog
Sign in / Sign up
ScienceGate
Search
Author Search
Journal Finder
Blog
Sign in / Sign up
Distributed Soft Path Coloring
Lecture Notes in Computer Science - STACS 2003
◽
10.1007/3-540-36494-3_46
◽
2003
◽
pp. 523-534
◽
Cited By ~ 1
Author(s):
Peter Damaschke
Keyword(s):
Path Coloring
Download Full-text
Related Documents
Cited By
References
An Illustration of $L$ (3, 2, 1)-path Coloring in Cryptography
10.1109/phdedits53295.2021.9649559
◽
2021
◽
Author(s):
Dhanyashree
◽
K. N. Meera
Keyword(s):
Path Coloring
Download Full-text
Games for Routing and Path Coloring
Game Theory for Control of Optical Networks
◽
10.1007/978-0-8176-8322-1_12
◽
2012
◽
pp. 211-223
Author(s):
Lacra Pavel
Keyword(s):
Path Coloring
Download Full-text
A Refined Analysis of Online Path Coloring in Trees
Approximation and Online Algorithms - Lecture Notes in Computer Science
◽
10.1007/978-3-319-51741-4_12
◽
2017
◽
pp. 142-154
Author(s):
Astha Chauhan
◽
N. S. Narayanaswamy
Keyword(s):
Path Coloring
Download Full-text
Selfish Routing and Path Coloring in All-Optical Networks
Combinatorial and Algorithmic Aspects of Networking - Lecture Notes in Computer Science
◽
10.1007/978-3-540-77294-1_8
◽
2007
◽
pp. 71-84
◽
Cited By ~ 3
Author(s):
Ioannis Milis
◽
Aris Pagourtzis
◽
Katerina Potika
Keyword(s):
Optical Networks
◽
Selfish Routing
◽
All Optical
◽
Path Coloring
Download Full-text
A 2-Approximation Algorithm for Path Coloring on Trees of Rings
Algorithms and Computation - Lecture Notes in Computer Science
◽
10.1007/3-540-40996-3_13
◽
2000
◽
pp. 144-155
◽
Cited By ~ 3
Author(s):
Xiaotie Deng
◽
Guojun Li
◽
Wenan Zang
◽
Yi Zhou
Keyword(s):
Approximation Algorithm
◽
Path Coloring
Download Full-text
The permutation-path coloring problem on trees
Theoretical Computer Science
◽
10.1016/s0304-3975(02)00635-7
◽
2003
◽
Vol 297
(1-3)
◽
pp. 119-143
◽
Cited By ~ 4
Author(s):
Sylvie Corteel
◽
Mario Valencia-Pabon
◽
Danièle Gardy
◽
Dominique Barth
◽
Alain Denise
Keyword(s):
Coloring Problem
◽
Path Coloring
Download Full-text
PATH COLORING PROBLEMS IN GRAPHS ARE NON-APPROXIMABLE
Advances in Informatics
◽
10.1142/9789812793928_0019
◽
2000
◽
Cited By ~ 1
Author(s):
CHRISTOS NOMIKOS
Keyword(s):
Path Coloring
Download Full-text
Path Coloring and Routing in Graphs
Graph Colorings - Contemporary Mathematics
◽
10.1090/conm/352/10
◽
2004
◽
pp. 139-152
◽
Cited By ~ 3
Author(s):
Jakub Białogrodski
Keyword(s):
Path Coloring
Download Full-text
Carving-decomposition based algorithms for the maximum path coloring problem
2012 IEEE International Conference on Communications (ICC)
◽
10.1109/icc.2012.6363762
◽
2012
◽
Author(s):
Mehwish Bashir
◽
Qian-Ping Gu
Keyword(s):
Coloring Problem
◽
Path Coloring
Download Full-text
The k-path coloring problem in graphs of bounded treewidth: An application in integrated circuit manufacturing
Operations Research Letters
◽
10.1016/j.orl.2020.07.017
◽
2020
◽
Vol 48
(5)
◽
pp. 652-657
Author(s):
Dehia Ait-Ferhat
◽
Vincent Juliard
◽
Gautier Stauffer
◽
Juan Andres Torres
Keyword(s):
Integrated Circuit
◽
Bounded Treewidth
◽
Coloring Problem
◽
Integrated Circuit Manufacturing
◽
Path Coloring
Download Full-text
Sign in / Sign up
Close
Export Citation Format
Close
Share Document
Close