Saving colors and max coloring: some fixed-parameter tractability results
From MaRDI portal
Publication:1755584
DOI10.1016/j.tcs.2018.08.002zbMath1417.05065OpenAlexW2888011314WikidataQ129360304 ScholiaQ129360304MaRDI QIDQ1755584
Publication date: 10 January 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2018.08.002
Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (2)
Parameterized Pre-Coloring Extension and List Coloring Problems ⋮ Parameterized complexity of list coloring and max coloring
Cites Work
- A coloring problem for weighted graphs
- Fundamentals of parameterized complexity
- Data reduction for graph coloring problems
- Time slot scheduling of compatible jobs
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
- Weighted coloring: further complexity and approximability results
- Geometric algorithms and combinatorial optimization
- Some simplified NP-complete graph problems
- The maximum saving partition problem
- Parameterized complexity of vertex colouring
- Algorithmic graph theory and perfect graphs
- Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
- Saving Colors and Max Coloring: Some Fixed-Parameter Tractability Results
- Weighted Coloring in Trees
- Graph-Theoretic Concepts in Computer Science
- Automata, Languages and Programming
- On the complexity of \(k\)-SAT
This page was built for publication: Saving colors and max coloring: some fixed-parameter tractability results
