Back to search

Frequency assignment: Theory and applications

Data up to Jan 2025

Published1980
Citations1,340
References74

Total Citations Per Year

Abstract

References (74)

Computers and Intractability: A Guide to the Theory of NP-Completeness

1979 • 45,565 citations

Reducibility among Combinatorial Problems

1972 • 10,743 citations

The complexity of theorem-proving procedures

1971 • 6,155 citations

Approximation algorithms for combinatorial problems

1974 • 2,224 citations

New methods to color the vertices of a graph

1979 • 1,548 citations

Computer and job-shop scheduling theory

1976 • 1,124 citations

On colouring the nodes of a network

1941 • 1,048 citations

Introduction to Sequencing and Scheduling

1977 • 887 citations

Graph Theory: An Algorithmic Approach

1976 • 757 citations

An upper bound for the chromatic number of a graph and its application to timetabling problems

1967 • 739 citations

Random Plane Networks

1961 • 657 citations

Some simplified NP-complete problems

1974 • 583 citations

Combinatorial Optimization

1980 • 570 citations

Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph

1972 • 536 citations

On Complementary Graphs

1956 • 445 citations

The Complexity of Coloring Circular Arcs and Chords

1980 • 399 citations

Graph Theory and Its Applications.

1970 • 325 citations

The Complexity of Near-Optimal Graph Coloring

1976 • 314 citations

Machine scheduling problems: Classification, complexity and computations

1977 • 307 citations

A note on the complexity of the chromatic number problem

1976 • 234 citations

GRAPH COLORING ALGORITHMS††This research was supported in part by the Advanced Research Projects Agency of the Department of Defense under contract SD-302 and by the National Science Foundation under contract GJ-446.

1972 • 227 citations

Coloring a Family of Circular Arcs

1975 • 221 citations

An inequality for the chromatic number of a graph

1968 • 216 citations

On the connection between chromatic number, maximal clique and minimal degree of a graph

1974 • 197 citations

New bounds on the number of unit spheres that can touch a unit sphere in n dimensions

1979 • 181 citations

Permutation Graphs and Transitive Graphs

1972 • 180 citations

A heuristic technique for assigning frequencies to mobile radio nets

1978 • 172 citations

The Eigenvalues of a Graph and Its Chromatic Number

1967 • 163 citations

Chromatic Scheduling and the Chromatic Number Problem

1972 • 143 citations

An Efficient Test for Circular-Arc Graphs

1980 • 132 citations

Sequencing by enumerative methods

1977 • 117 citations

A Breakthrough in Spectrum Conserving Frequency Assignment Technology

1977 • 114 citations

The complexity of comparability graph recognition and coloring

1977 • 113 citations

The Theory of Graphs and Its Applications.

1963 • 96 citations

Perfect Graphs and an Application to Optimizing Municipal Services

1973 • 94 citations

A technique for colouring a graph applicable to large scale timetabling problems

1969 • 93 citations

An algorithm for the chromatic number of a graph

1971 • 91 citations

A bound on the chromatic number of a graph

1978 • 78 citations

The Efficiency of Algorithms

1978 • 70 citations

The probability of covering a sphere with N circular caps

1965 • 61 citations

Determining the Chromatic Number of a Graph

1979 • 59 citations

An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs

1981 • 57 citations

Covering the vertex set of a graph with subgraphs of smaller degree

1978 • 44 citations

The expected number of clumps when convex laminae are placed at random and with random orientation on a plane area

1954 • 43 citations

An Algorithm for Determining the Chromatic Number of a Graph

1973 • 41 citations

AN OVERLAP PROBLEM ARISING IN PARTICLE COUNTING

1949 • 40 citations

An Overlap Problem Arising in Particle Counting

1949 • 40 citations

Computer prediction of field strength in the planning of radio systems

1975 • 37 citations

Another bound on the chromatic number of a graph

1978 • 36 citations

On Various Algorithms for Estimating the Chromatic Number of a Graph

1976 • 36 citations

Frequency Assignment Games and Strategies

1973 • 34 citations

An Algorithm for the Chromatic Number of a Graph

1974 • 23 citations

Algorithm 286: Examination scheduling

1966 • 20 citations

Bounds for the chromatic number of a graph

1969 • 19 citations

The Solution of the Graph-Coloring Problem as a Set-Covering Problem

1977 • 18 citations

Heuristic procedures (if they work—leave them alone)

1974 • 14 citations

Bounded color functions on graphs

1972 • 13 citations

Spectrum management techniques

1978 • 11 citations

A lower bound on the chromatic number of a graph

1971 • 10 citations

UHF Taboos-History and Development

1978 • 9 citations

Compatibility and the Frequency Selection Problem

1975 • 9 citations

Algorithms for finding in the lump both bounds of the chromatic number of a graph

1976 • 7 citations

Majorants of the Chromatic Number of a Random Graph

1969 • 7 citations

An algorithm for obtaining the chromatic number and an optimal coloring of a graph

1973 • 5 citations

A practical approach to the chromatic partition problem

1970 • 5 citations

An Automated Frequency Assignment System for Air Voice Communication Circuits in the Frequency Band from 225 MHz to 400 MHz

1977 • 4 citations

A Frequency Assignment Algorithm Based on a Minimum Residual Difficulty Heuristic

1979 • 3 citations

Parameter sensitivity analysis - An approach used in the investigation of frequency assignment problems

1978 • 3 citations

The coloring of graphs in a linear number of steps

1974 • 3 citations

A new method to find out the chromatic partition of a symmetric graph

1978 • 3 citations

A graph coloring algorithm and a scheduling problem

1971 • 2 citations

A Parameter-Sensitive Frequency-Assignment Method (PSFAM)

1977 • 2 citations

An Algorithm for Determining the Chromatic Number of a Finite Graph

1985 • 2 citations

Efficient algorithms for (3, 1) graphs

1977 • 1 citations

Cited By (0)

Loading...