Keyword: graphs

Found 1175 papers in total
Extending the Kernel for Planar Steiner Tree to the Number of Steiner Vertices
Extending the Kernel for Planar Steiner Tree to the Number of Steiner Vertices
2017,
In the Steiner Tree problem one is given an undirected graph, a subset T of its...
Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals
Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals
2017,
Given an undirected, edge‐weighted graph G together with pairs of vertices,...
Parameterized and Approximation Algorithms for the Load Coloring Problem
Parameterized and Approximation Algorithms for the Load Coloring Problem
2017,
Let c , k be two positive integers. Given a graph G = ( V , E ) , the c ‐ Load...
How to Sort by Walking and Swapping on Paths and Trees
How to Sort by Walking and Swapping on Paths and Trees
2017,
Consider a graph G with n vertices. On each vertex we place a box. The n vertices and...
Improved Analysis of Complete-Linkage Clustering
Improved Analysis of Complete-Linkage Clustering
2017,
Complete‐linkage clustering is a very popular method for computing hierarchical...
A Polynomial Kernel for Block Graph Deletion
A Polynomial Kernel for Block Graph Deletion
2017,
In the Block Graph Deletion problem, we are given a graph G on n vertices and a...
Quick but Odd Growth of Cacti
Quick but Odd Growth of Cacti
2017,
Let F be a family of graphs. Given an n ‐vertex input graph G and a positive...
Frequency assignment problem in networks with limited spectrum
Frequency assignment problem in networks with limited spectrum
2017,
The frequency assignment problem (FAP) asks for assigning frequencies (channels) in a...
On the resolution of certain discrete univariate max‐min problems
On the resolution of certain discrete univariate max‐min problems
2017,
We analyze a class of discrete, univariate, and strictly quasiconcave max–min...
New upper bound on m-time-relaxed k-broadcast graphs
New upper bound on m-time-relaxed k-broadcast graphs
2017,
Broadcasting is a process in which an individual has an item of information which...
Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis
Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis
2017,
The Quadratic Unconstrained Binary Optimization problem (QUBO) has become a unifying...
Exact and Heuristic Algorithms for Risk-Aware Stochastic Physical Search
Exact and Heuristic Algorithms for Risk-Aware Stochastic Physical Search
2017,
We consider an intelligent agent seeking to obtain an item from one of several...
A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique
A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique
2017,
The quadratic assignment problem (QAP) is a combinatorial optimization problem that...
Geodesic and contour optimization using conformal mapping
Geodesic and contour optimization using conformal mapping
2017,
We propose a novel optimization algorithm for differentiable functions utilizing...
Strong valid inequalities for Boolean logical pattern generation
Strong valid inequalities for Boolean logical pattern generation
2017,
0–1 multilinear programming (MP) captures the essence of pattern generation in...
Algorithms for constructing optimal n-networks in metric spaces
Algorithms for constructing optimal n-networks in metric spaces
2017,
We study optimal approximations of sets in various metric spaces with sets of balls of...
Improved upper bound for the degenerate and star chromatic numbers of graphs
Improved upper bound for the degenerate and star chromatic numbers of graphs
2017,
Let G = G ( V , E ) be a graph. A proper coloring of G is a function f : V → N...
Fractional matching preclusion of graphs
Fractional matching preclusion of graphs
2017,
Let F be an edge subset and F ′ a subset of edges and vertices of a graph G . If...
On the online multi-agent O‐D k-Canadian Traveler Problem
On the online multi-agent O‐D k-Canadian Traveler Problem
2017,
In this article, we present new results on the online multi‐agent O–D k...
On Motzkin‐Straus type results for non-uniform hypergraphs
On Motzkin‐Straus type results for non-uniform hypergraphs
2017,
Recently, some extensions of Motzkin–Straus theorems were proved for...
Total edge irregularity strength of accordion graphs
Total edge irregularity strength of accordion graphs
2017,
An edge irregular total k ‐labeling φ : V ∪ E → { 1 , 2 , …...
Distance domination in graphs with given minimum and maximum degree
Distance domination in graphs with given minimum and maximum degree
2017,
For an integer k ≥ 1 , a distance k ‐dominating set of a connected graph G...
On maximum Wiener index of trees and graphs with given radius
On maximum Wiener index of trees and graphs with given radius
2017,
Let G be a connected graph of order n . The long‐standing open and close...
A note on orientation and chromatic number of graphs
A note on orientation and chromatic number of graphs
2017,
Let D be any edge orientation of a graph G . We denote by Δ k ( D ) the maximum...
Papers per page: