Amanote Research

Amanote Research

    RegisterSign In

A Problem Kernelization for Graph Packing

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-95891-8_37
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2009

Authors
Hannes Moser
Publisher

Springer Berlin Heidelberg


Related search

A Packing Problem for Holomorphic Curves

Nagoya Mathematical Journal
Mathematics
2009English

A Harmonic Algorithm for the 3D Strip Packing Problem

SIAM Journal on Computing
MathematicsComputer Science
2013English

Modified Strip Packing Heuristics for the Rectangular Variable-Sized Bin Packing Problem

ORiON
2010English

The Repacking Efficiency for Bandwidth Packing Problem

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2007English

The Shortest Path Problem for a Multiple Graph

Modeling and Analysis of Information Systems
2017English

A Combinational Heuristic Algorithm for the Three-Dimensional Packing Problem

Ruan Jian Xue Bao/Journal of Software
Software
2007English

An Adaptive Genetic Algorithm for 2D Packing Problem

Modern Applied Science
2010English

A Hybrid Algorithm for the Robust Graph Coloring Problem

Revista de Matemática: Teoría y Aplicaciones
2016English

A Parallel McMc Algorithm for the Balanced Graph Coloring Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy