Keyword: graphs

Found 1175 papers in total
Scheduling with disjunctive constraints
Scheduling with disjunctive constraints
1996,
The job shop scheduling problem consists of determining a sequence of jobs to be...
Weighted fractional and integral k-matching in hypergraphs
Weighted fractional and integral k-matching in hypergraphs
1995,
The authors consider the problem of finding polynomial-time approximations of maximal...
Applying Lehman’s theorems to packing problems
Applying Lehman’s theorems to packing problems
1995,
A 0-1 matrix A is ideal if the polyhedron Q(A)= conv{ x∈ Q ’...
Note on scheduling intervals on-line
Note on scheduling intervals on-line
1995,
An optimal on-line algorithm is presented for the following optimization problem,...
Medium-term production planning of shots for a low earth orbit satellite based on independent sets
Medium-term production planning of shots for a low earth orbit satellite based on independent sets
1995,
This paper deals with the combinatorial problem of medium-term production planning of...
Generating hard and diverse test sets for NP-hard graph problems
Generating hard and diverse test sets for NP-hard graph problems
1995,
In evaluating the performance of approximation algorithms for NP-hard problems, it is...
Stock cutting of complicated designs by computing minimal nested polygons
Stock cutting of complicated designs by computing minimal nested polygons
1995,
This paper studies the following problem in stock cutting: when it is required to cut...
The random division of faces in a planar graph
The random division of faces in a planar graph
1996,
A planar graph contains faces which can be classified into types depending on the...
Queueing methods in the theory of random graphs
Queueing methods in the theory of random graphs
1995,
In this article several limit theorems are proved for the fluctuations of the queue...
Vertex-symmetric digraphs with small diameter
Vertex-symmetric digraphs with small diameter
1995,
There is increasing interest in the design of dense vertex-symmetric graphs and...
Expanding and forwarding
Expanding and forwarding
1995,
Expanding parameters of graphs (magnification constant, edge and vertex cutset...
Two remarks on ‘Expanding and Forwarding’ by P. Solé
Two remarks on ‘Expanding and Forwarding’ by P. Solé
1995,
The paper makes two remarks on a paper of Solé. First, it improves his lower...
Adjacency on combinatorial polyhedra
Adjacency on combinatorial polyhedra
1995,
This paper shows some useful properties of the adjacency structures of a class of...
Generating lower bounds for the linear arrangement problem
Generating lower bounds for the linear arrangement problem
1995,
The linear arrangement problem is a fundamental problem that arises in many practical...
A cutting-plane approach to the edge-weighted maximal clique problem
A cutting-plane approach to the edge-weighted maximal clique problem
1993,
The authors investigate the computational performance of a cutting-plane algorithm for...
An efficient parallel parsing algorithm for context-free languages based on Earley's method
An efficient parallel parsing algorithm for context-free languages based on Earley's method
1996,
The authors propose a parallel parsing algorithm based on Earley's method, which works...
From graphs to matroids: Generating research questions
From graphs to matroids: Generating research questions
1995,
As all graphs have associated matroids but not all matroids are graphical, there is a...
Complexity and algorithm for Reallocation Problem
Complexity and algorithm for Reallocation Problem
1996,
The authors define the Reallocation Problem to determine whether we can move products...
On the complexity of embedding of graphs into grids with minimum congestion
On the complexity of embedding of graphs into grids with minimum congestion
1996,
It is known that the problem of determining, given a planar graph G with maximum...
The maximum-weight-window problem of a planar graph
The maximum-weight-window problem of a planar graph
1995,
An undirected graph is called a planar graph if it can be drawn on a plane without the...
Largest similar substructure problems for trees and their algorithms
Largest similar substructure problems for trees and their algorithms
1995,
This paper discusses the problems of finding similar substructures in tree T b to tree...
Algorithms for computing the distances between unordered trees
Algorithms for computing the distances between unordered trees
1995,
This paper proposes algorithms for computing three kinds of distances between two...
An efficient algorithm for drawing tree structured diagrams
An efficient algorithm for drawing tree structured diagrams
1996,
Various algorithms have been proposed for the problem of drawing rooted ordered trees....
Efficient algorithm for finding largest similar substructures in unordered trees
Efficient algorithm for finding largest similar substructures in unordered trees
1996,
This paper discusses the problems of finidng one of the largest similar substructures...
Papers per page: