Keyword: graphs

Found 1175 papers in total
Analytic Variations on the Airy Distribution
Analytic Variations on the Airy Distribution
2001,
The Airy distribution (of the ‘area’ type) occurs as a limit distribution...
A Limit Law for Outputs in Random Recursive Circuits
A Limit Law for Outputs in Random Recursive Circuits
2001,
We study the structure of uniform random binary recursive circuits. We show that a...
Grade of Service Steiner Minimum Trees in the Euclidean Plane
Grade of Service Steiner Minimum Trees in the Euclidean Plane
2001,
Let P = {p 1 , p 2 , \ldots, p n } be a set of n {\lilsf terminal points} in the...
Relaxed Balance Using Standard Rotations
Relaxed Balance Using Standard Rotations
2001,
In search trees with relaxed balance, rebalancing transformations need not be...
Reconstructing a Minimum Spanning Tree after Deletion of Any Node
Reconstructing a Minimum Spanning Tree after Deletion of Any Node
2001,
Updating a minimum spanning tree (MST) is a basic problem for communication networks....
An Algorithm for Computing a Convex and Simple Path of Bounded Curvature in a Simple Polygon
An Algorithm for Computing a Convex and Simple Path of Bounded Curvature in a Simple Polygon
2002,
In this paper we study the collision-free path planning problem for a point robot,...
Pairs of Complementary Unary Languages with ‘Balanced’ Nondeterministic Automata
Pairs of Complementary Unary Languages with ‘Balanced’ Nondeterministic Automata
2012,
For each sufficiently large n , there exists a unary regular language L such that both...
A cyclic representation of discrete coordination procedures
A cyclic representation of discrete coordination procedures
2012,
We show that any discrete opinion pooling procedure with positive weights can be...
Partitioning planar graphs: a fast combinatorial approach for max‐cut
Partitioning planar graphs: a fast combinatorial approach for max‐cut
2012,
The max‐cut problem asks for partitioning the nodes V of a graph G =( V , E )...
On the construction of k‐connected m‐dominating sets in wireless networks
On the construction of k‐connected m‐dominating sets in wireless networks
2012,
Connected dominating sets (CDS) that serve as a virtual backbone are now widely used...
A Bayesian network structure for operational risk modelling in structured finance operations
A Bayesian network structure for operational risk modelling in structured finance operations
2012,
This paper is concerned with the design of a Bayesian network structure that is...
Complexity of scheduling of coupled tasks with chains precedence constraints and any constant length of gap
Complexity of scheduling of coupled tasks with chains precedence constraints and any constant length of gap
2012,
Coupled tasks scheduling was originally introduced for modelling complex radar...
A benchmark library and a comparison of heuristic methods for the linear ordering problem
A benchmark library and a comparison of heuristic methods for the linear ordering problem
2012,
The linear ordering problem consists of finding an acyclic tournament in a complete...
A combinatorial optimization algorithm for solving the branchwidth problem
A combinatorial optimization algorithm for solving the branchwidth problem
2012,
In this paper, we consider the problem of computing an optimal branch decomposition of...
An evolutionary approach for tuning parametric Esau and Williams heuristics
An evolutionary approach for tuning parametric Esau and Williams heuristics
2012,
Owing to its inherent difficulty, many heuristic solution methods have been proposed...
Analysis and approximation for bank selection instruction minimization on partitioned memory architecture
Analysis and approximation for bank selection instruction minimization on partitioned memory architecture
2012,
A large number of embedded systems include 8‐bit microcontrollers for their...
An ILS heuristic for the traveling tournament problem with predefined venues
An ILS heuristic for the traveling tournament problem with predefined venues
2012,
The Traveling Tournament Problem with Predefined Venues (TTPPV) is a single round...
Linear combinations of heuristics for examination timetabling
Linear combinations of heuristics for examination timetabling
2012,
Although they are simple techniques from the early days of timetabling research, graph...
Approximate algorithms with estimates for routing problems on random inputs with a bounded number of customers per route
Approximate algorithms with estimates for routing problems on random inputs with a bounded number of customers per route
2012,
We propose approximate algorithms for routing problems with a bounded number of...
Speeding up computation of the reliability polynomial coefficients for a random graph
Speeding up computation of the reliability polynomial coefficients for a random graph
2011,
We consider the problem of computing the coefficients of the reliability polynomial...
Synchronization in networks of linear agents with output feedbacks
Synchronization in networks of linear agents with output feedbacks
2011,
The problem is considered of asymptotic synchronization by states in networks of...
A formal method for analysing and assessing operational risk in supply chains
A formal method for analysing and assessing operational risk in supply chains
2012,
This paper formalises an objective method to identify and assess operational risk in...
Combinatorial Optimization by Dynamic Contraction
Combinatorial Optimization by Dynamic Contraction
1997,
A heuristic optimization methodology, Dynamic Contraction (DC), is introduced as an...
Performance‐Driven Layer Assignment by Integer Linear Programming and Path‐Constrained Hypergraph Partitioning
Performance‐Driven Layer Assignment by Integer Linear Programming and Path‐Constrained Hypergraph Partitioning
1997,
Performance‐driven physical layout design is becoming increasingly important...
Papers per page: