Keyword: graphs

Found 1175 papers in total
Matroid and Knapsack Center Problems
Matroid and Knapsack Center Problems
2016,
In the classic k ‐center problem, we are given a metric graph, and the...
Superpolynomial Lower Bounds for the (1+1) EA on Some Easy Combinatorial Problems
Superpolynomial Lower Bounds for the (1+1) EA on Some Easy Combinatorial Problems
2016,
The ( 1 + 1 ) EA is a simple evolutionary algorithm that is known to be efficient...
On the Read-Once Property of Branching Programs and CNFs of Bounded Treewidth
On the Read-Once Property of Branching Programs and CNFs of Bounded Treewidth
2016,
In this paper we prove a space lower bound of n Ω ( k ) for...
Finding Shortest Paths Between Graph Colourings
Finding Shortest Paths Between Graph Colourings
2016,
The k ‐colouring reconfiguration problem asks whether, for a given graph G ,...
A strategic model for state compliance verification
A strategic model for state compliance verification
2016,
The theory of directed graphs and noncooperative games is applied to the problem of...
Branched coverings and Steiner ratio
Branched coverings and Steiner ratio
2016,
For a branched locally isometric covering of metric spaces with intrinsic metrics, it...
Measuring Olympics performance based on a distance-based approach
Measuring Olympics performance based on a distance-based approach
2016,
Measuring Olympics performance using either the Summer Olympic Games or Winter...
Online version of the theorem of Thue
Online version of the theorem of Thue
2013,
A sequence S is nonrepetitive if no two adjacent blocks of S are the same. In 1906...
Line graph operation and small worlds
Line graph operation and small worlds
2013,
Complex networks, such as small world networks, are the focus of recent interest...
Split Vertex Deletion meets Vertex Cover: New fixed-parameter and exact exponential-time algorithms
Split Vertex Deletion meets Vertex Cover: New fixed-parameter and exact exponential-time algorithms
2013,
In the Split Vertex Deletion problem, given a graph G and an integer k , we ask...
Free-gram phrase identification for modeling Chinese text
Free-gram phrase identification for modeling Chinese text
2013,
Vector space model using bag of phrases plays an important role in modeling Chinese...
Choosability on H-free graphs
Choosability on H-free graphs
2013,
A graph is H ‐free if it has no induced subgraph isomorphic to H . We determine...
(Non-)existence of polynomial kernels for the Test Cover problem
(Non-)existence of polynomial kernels for the Test Cover problem
2013,
The input of the Test Cover problem consists of a set V of vertices, and a collection...
The complexity of geodesic Voronoi diagrams on triangulated 2-manifold surfaces
The complexity of geodesic Voronoi diagrams on triangulated 2-manifold surfaces
2013,
We study the combinatorial complexity of Voronoi diagram of point sites on a general...
Multi-attributes based comparison of JIT distribution process of supply chain
Multi-attributes based comparison of JIT distribution process of supply chain
2015,
Distribution process of a supply chain management is very important and strategic. To...
Local search metaheuristics for the critical node problem
Local search metaheuristics for the critical node problem
2016,
We present two metaheuristics for the Critical Node Problem, that is, the maximal...
An equi-model matheuristic for the multi-depot ring star problem
An equi-model matheuristic for the multi-depot ring star problem
2016,
In the multi‐depot ring star problem (MDRSP), a set of customers has to be...
A multicast routing algorithm based on searching in directed graph
A multicast routing algorithm based on searching in directed graph
2011,
Aiming at constructing a delay and delay variation bounded Steiner tree in the...
Hamiltonicity in connected regular graphs
Hamiltonicity in connected regular graphs
2013,
In 1980, Jackson proved that every 2‐connected k ‐regular graph with at...
Another disjoint compression algorithm for odd cycle transversal
Another disjoint compression algorithm for odd cycle transversal
2013,
Given a graph G and an odd cycle transversal T, we describe an elegant...
Algorithmic aspect of stratified domination in graphs
Algorithmic aspect of stratified domination in graphs
2013,
Chartrand, Haynes, Henning and Zhang introduced a variation of domination called...
A note on minimum-sum coverage by aligned disks
A note on minimum-sum coverage by aligned disks
2013,
In this paper, we consider a facility location problem to find a minimum-sum coverage...
Metric tree-like structures in real-world networks: an empirical study
Metric tree-like structures in real-world networks: an empirical study
2016,
Based on solid theoretical foundations, we present strong evidence that a number of...
Robust reconstruction of Barabási-Albert networks in the broadcast congested clique model
Robust reconstruction of Barabási-Albert networks in the broadcast congested clique model
2016,
In the broadcast version of the congested clique model, n nodes communicate in...
Papers per page: