Parameterized Maximum Path Coloring (Q2891353)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Parameterized Maximum Path Coloring	scientific article

Statements

scholarly article

0 references

Parameterized Maximum Path Coloring (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-642-28050-4_19

0 references

0 references

Parameterized and Exact Computation

0 references

publication date

15 June 2012

0 references

full work available at URL

http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-58575

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

Call control with \(k\) rejections

0 references

Linear FPT reductions and computational lower bounds

0 references

0 references

The complexity of path coloring and call scheduling

0 references

The Maximum Edge-Disjoint Paths Problem in Bidirected Trees

0 references

Optimal wavelength routing on directed fiber trees

0 references

Parametrized complexity theory.

0 references

The Complexity of Coloring Circular Arcs and Chords

0 references

Primal-dual approximation algorithms for integral flow and multicut in trees

0 references

Edge and vertex intersection of paths in a tree

0 references

On the complexity of \(k\)-SAT

0 references

0 references

A note on optical routing on trees

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2891353

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2891353&oldid=35284387"