Keyword: graphs

Found 1175 papers in total
Independent sets in some classes of Si,j,k-free graphs
Independent sets in some classes of Si,j,k-free graphs
2017,
The maximum weight independent set (MWIS) problem on graphs with vertex weights asks...
Matching and domination numbers in r-uniform hypergraphs
Matching and domination numbers in r-uniform hypergraphs
2017,
A matching is a set of pairwise disjoint hyperedges of a hypergraph H . The matching...
The Weight Function Lemma for graph pebbling
The Weight Function Lemma for graph pebbling
2017,
Graph pebbling is a network model for studying whether or not a given supply of...
The adjacent vertex distinguishing total chromatic numbers of planar graphs with Δ=10
The adjacent vertex distinguishing total chromatic numbers of planar graphs with Δ=10
2017,
A (proper) total‐ k ‐coloring of a graph G is a mapping ϕ : V ( G )...
A note on (s, t)-relaxed L(2, 1)-labeling of graphs
A note on (s, t)-relaxed L(2, 1)-labeling of graphs
2017,
Let G = ( V , E ) be a graph. For two vertices u and v in G , we denote d G ( u , v )...
Equitable vertex arboricity of 5-degenerate graphs
Equitable vertex arboricity of 5-degenerate graphs
2017,
Wu et al. (Discret Math 313:2696–2701, 2013) conjectured that the vertex set of...
On the vertex cover P3 problem parameterized by treewidth
On the vertex cover P3 problem parameterized by treewidth
2017,
Consider a graph G . A subset of vertices, F , is called a vertex cover P t ( V C P t...
Symmetry properties of resolving sets and metric bases in hypercubes
Symmetry properties of resolving sets and metric bases in hypercubes
2017,
In this paper we consider some special characteristics of distances between vertices...
General Variable Neighborhood Search for computing graph separators
General Variable Neighborhood Search for computing graph separators
2017,
Computing graph separators in networks has a wide range of real‐world...
A metaheuristic approach to the dominating tree problem
A metaheuristic approach to the dominating tree problem
2017,
This paper considers a recently introduced NP‐hard problem on graphs, called...
Mechanism design for land acquisition
Mechanism design for land acquisition
2017,
We consider the issue of designing Bayesian incentive‐compatible, efficient,...
Coordination games on graphs
Coordination games on graphs
2017,
We introduce natural strategic games on graphs, which capture the idea of coordination...
Primal‐Dual Algorithms for Precedence Constrained Covering Problems
Primal‐Dual Algorithms for Precedence Constrained Covering Problems
2017,
A covering problem is an integer linear program of type min { c T x ∣ A x ≥ D ,...
Online Packet-Routing in Grids with Bounded Buffers
Online Packet-Routing in Grids with Bounded Buffers
2017,
We present deterministic and randomized algorithms for the problem of online packet...
Robustness of the Rotor‐Router Mechanism
Robustness of the Rotor‐Router Mechanism
2017,
The rotor–router model , also called the Propp machine , was first considered as...
On Computing an Optimal Semi-matching
On Computing an Optimal Semi-matching
2017,
A semi‐matching in a bipartite graph G = ( U , V , E ) is a set of edges M...
Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity
Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity
2017,
We consider the problems of finding optimal identifying codes, (open)...
Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT
Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT
2017,
We present several sparsification lower and upper bounds for classic problems in graph...
On the Approximability of Digraph Ordering
On the Approximability of Digraph Ordering
2017,
Given an n ‐vertex digraph D = ( V , A ) the Max ‐ k ‐ Ordering...
Node, Edge, Arc Routing and Turn Penalties: Multiple Problems–One Neighborhood Extension
Node, Edge, Arc Routing and Turn Penalties: Multiple Problems–One Neighborhood Extension
2017,
This article explores a structural neighborhood decomposition for arc routing...
Vehicle routing strategies for pick-up and delivery service under two dimensional loading constraints
Vehicle routing strategies for pick-up and delivery service under two dimensional loading constraints
2017,
This work compares the transportation costs incurred by three alternative strategies...
Mathematical models and routing algorithms for CAD technological preparation of cutting processes
Mathematical models and routing algorithms for CAD technological preparation of cutting processes
2017,
Resource‐conscious technologies for cutting sheet material include the ICP and...
A recursive formula for the two-edge connected and biconnected reliability of a complete graph
A recursive formula for the two-edge connected and biconnected reliability of a complete graph
2017,
The reliability polynomial R ( G , p ) of a finite undirected graph G = ( V , E )...
Hardness and approximation for network flow interdiction
Hardness and approximation for network flow interdiction
2017,
In the Network Flow Interdiction problem, an adversary attacks a network in order to...
Papers per page: