Keyword: graphs

Found 1175 papers in total
Improved Approximation Algorithms for the Spanning Star Forest Problem
Improved Approximation Algorithms for the Spanning Star Forest Problem
2013,
A star graph is a tree of diameter at most two. A star forest is a graph that consists...
Mapping Simple Polygons: How Robots Benefit from Looking Back
Mapping Simple Polygons: How Robots Benefit from Looking Back
2013,
We consider the problem of mapping an initially unknown polygon of size n with a...
Improved Algorithms for Some Competitive Location Centroid Problems on Paths, Trees and Graphs
Improved Algorithms for Some Competitive Location Centroid Problems on Paths, Trees and Graphs
2013,
We consider a common scenario in competitive location, where two competitors...
On Finding Min-Min Disjoint Paths
On Finding Min-Min Disjoint Paths
2013,
The Min‐Min problem of finding a disjoint‐path pair with the length of...
Approximating Points by a Piecewise Linear Function
Approximating Points by a Piecewise Linear Function
2013,
Approximating points by piecewise linear functions is an intensively researched topic...
The Longest Path Problem Is Polynomial on Cocomparability Graphs
The Longest Path Problem Is Polynomial on Cocomparability Graphs
2013,
The longest path problem is the problem of finding a path of maximum length in a...
FlipCut Supertrees: Towards Matrix Representation Accuracy in Polynomial Time
FlipCut Supertrees: Towards Matrix Representation Accuracy in Polynomial Time
2013,
In computational phylogenetics, supertree methods provide a way to reconstruct larger...
The School Bus Problem on Trees
The School Bus Problem on Trees
2013,
The School Bus Problem is an NP‐hard vehicle routing problem in which the goal...
Route-Enabling Graph Orientation Problems
Route-Enabling Graph Orientation Problems
2013,
Given an undirected and edge‐weighted graph G together with a set of ordered...
Two-stage Robust Network Design with Exponential Scenarios
Two-stage Robust Network Design with Exponential Scenarios
2013,
We study two‐stage robust variants of combinatorial optimization problems on...
A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem
A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem
2013,
Given an undirected graph G =( V , E ) with positive edge lengths and two vertices s...
A Dirichlet‐Neumann cost functional approach for the Bernoulli problem
A Dirichlet‐Neumann cost functional approach for the Bernoulli problem
2013,
The Bernoulli problem is rephrased into a shape optimization problem. In particular,...
Attitudes and preferences: Approaches to representing decision maker desires
Attitudes and preferences: Approaches to representing decision maker desires
2012,
Informative interrelationships between attitudes and preferences when formally...
A note on iterative process for G 2-multi degree reduction of Bézier curves
A note on iterative process for G 2-multi degree reduction of Bézier curves
2012,
In the paper [A. Rababah, S. Mann, Iterative process for G 2 ‐multi degree...
Approximating sets on a plane with optimal sets of circles
Approximating sets on a plane with optimal sets of circles
2012,
We study optimal networks on a plane. We generalize the Chebyshev center of a set on...
Structural properties of the scale-free Barabasi-Albert graph
Structural properties of the scale-free Barabasi-Albert graph
2012,
Consideration was given to the scale‐free Barabasi‐Albert graph...
Using nonlinear approximation to estimate the parameters of plant time to failure
Using nonlinear approximation to estimate the parameters of plant time to failure
2012,
A method was proposed for construction of the generalized distributions employed in...
Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs
Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs
2013,
The Hamiltonian Cycle problem is the problem of deciding whether an n ‐vertex...
A geometric representation of profits in a supply chain network
A geometric representation of profits in a supply chain network
2012,
Economists express profits as areas representing producer's surplus or consumer's...
A branch-and-bound algorithm for the acyclic partitioning problem
A branch-and-bound algorithm for the acyclic partitioning problem
2014,
We focus on the problem of partitioning the vertex set of a directed, edge‐ and...
A graph theoretic approach to problem formulation for multidisciplinary design analysis and optimization
A graph theoretic approach to problem formulation for multidisciplinary design analysis and optimization
2014,
The formulation of multidisciplinary design, analysis, and optimization (MDAO)...
On multigrid-CG for efficient topology optimization
On multigrid-CG for efficient topology optimization
2014,
This article presents a computational approach that facilitates the efficient solution...
Visual design steering for optimization solution improvement
Visual design steering for optimization solution improvement
2001,
The paradigm of Visual Design Steering is applied to formal optimal design solution...
Generation and use of sparse navigation graphs for microscopic pedestrian simulation models
Generation and use of sparse navigation graphs for microscopic pedestrian simulation models
2012,
For the spatial design of buildings as well as for the layout of large event areas,...
Papers per page: