Graph coloring algorithms for fast evaluation of Curtis decompositions

Authors:
Marek Perkowski;Rahul Malvi;Stan Grygiel;Mike Burns;Alan Mishchenko
Affiliations:
Portland State University, Department of Electrical and Computer Engineering, Portland, Oregon;Portland State University, Department of Electrical and Computer Engineering, Portland, Oregon;Portland State University, Department of Electrical and Computer Engineering, Portland, Oregon;Portland State University, Department of Electrical and Computer Engineering, Portland, Oregon;Portland State University, Department of Electrical and Computer Engineering, Portland, Oregon
Venue:
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Year:
1999

Citing 14
Cited 4

A theoretical analysis of backtracking in the graph coloring problem

Journal of Algorithms
PALMINI—fast Boolean minimizer for personal computers

DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Coloring heuristics for register allocation

PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
A coloring problem

American Mathematical Monthly
Finding maximum cliques in arbitrary and in special graphs

Computing
A new approach to the decomposition of incompletely specified multi-output functions based on graph coloring and local transformations and its application to FPGA mapping

EURO-DAC '92 Proceedings of the conference on European design automation
New approximation algorithms for graph coloring

Journal of the ACM (JACM)
Exact coloring of real-life graphs is easy

DAC '97 Proceedings of the 34th annual Design Automation Conference
The Complexity of Near-Optimal Graph Coloring

Journal of the ACM (JACM)
A Sufficient Condition for Backtrack-Free Search

Journal of the ACM (JACM)
New Compact Representation of Multiple-Valued Functions, Relations, and Non-deterministic State Machines

ICCD '98 Proceedings of the International Conference on Computer Design
Decomposition of multiple-valued relations

ISMVL '97 Proceedings of the 27th International Symposium on Multiple-Valued Logic
Cube diagram bundles: a new representation of strongly unspecified multiple-valued functions and relations

ISMVL '97 Proceedings of the 27th International Symposium on Multiple-Valued Logic
An Efficient Approach to Decomposition of Multi-Output Boolean Functions with Large Sets of Bound Variables

EUROMICRO '98 Proceedings of the 24th Conference on EUROMICRO - Volume 1

Learning Hardware Using Multiple-Valued Logic, Part 1: Introduction and Approach

IEEE Micro
A new enhanced constructive decomposition and mapping algorithm

Proceedings of the 40th annual Design Automation Conference
Exploiting hierarchy and structure to efficiently solve graph coloring as SAT

Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Logic synthesis based on decomposition for CPLDs

Microprocessors & Microsystems

Quantified Score

Hi-index	0.00

Graph coloring algorithms for fast evaluation of Curtis decompositions

Quantified Score

Visualization

Abstract