Add to ORKGСекция 10. Теоретическая информатикаIn this paper, we introduce the concept of a distance-(k, l) matching of a graph, which is a subset of edges of this graph such that the number of intermediate edges in the shortest path between any two edges of this set lies between k and l. We prove that the problem MAXIMUM DISTANCE-(k, l) MATCHING, which asks whether a graph contains a distance-(k, l) matching of size exceeding a given number, is NP-complete for arbitrary given or variable k and l, and that the weighted variant of this problem is strongly NP-complete even for bipartite graphs. We also present several upper bounds on the size of a maximum distance-(k, l) matching
In this BSc thesis we focus on one of the most important topics in combinatorial optimization, known...
AbstractWe consider the problem of finding all maximally-matchable edges in a bipartite graph G=(V,E...
In this paper, we consider the minimum maximal matching problem in some classes of graphs such as re...
Секция 10. Теоретическая информатикаIn this paper, we introduce the concept of a distance-(k, l) mat...
We study the computational complexity of several problems connected withfinding a maximal distance-$...
AbstractFor a finite undirected graph G=(V,E) and positive integer k≥1, an edge set M⊆E is a distanc...
By advancing the idea of finding width in bipartite graphs and basic definitions in matching theory,...
AMS Subject Classication: 05C80, 05C70 Abstract. In this paper we study the maximal size of a distan...
Suppose G = (V, E) is a simple graph and k is a fixed positive integer. A subset D subset of V is a ...
By advancing the idea of finding width in bipartite graphs and basic definitions in matching theory,...
We present a quasi linear-time algorithm for Maximum Matching on distance-hereditary graphs and some...
. A new approximation algorithm for maximum weighted matching in general edge-weighted graphs is pre...
We consider a distance generalisation of the strong chromatic index and the maximum induced matching...
Let G = (V ; E) be an undirected graph. Given an odd number k = 2l + 1, a matching M is said to be k...
International audienceBy Berge's theorem, finding a maximum matching in a graph relies on the use of...
In this BSc thesis we focus on one of the most important topics in combinatorial optimization, known...
AbstractWe consider the problem of finding all maximally-matchable edges in a bipartite graph G=(V,E...
In this paper, we consider the minimum maximal matching problem in some classes of graphs such as re...
Секция 10. Теоретическая информатикаIn this paper, we introduce the concept of a distance-(k, l) mat...
We study the computational complexity of several problems connected withfinding a maximal distance-$...
AbstractFor a finite undirected graph G=(V,E) and positive integer k≥1, an edge set M⊆E is a distanc...
By advancing the idea of finding width in bipartite graphs and basic definitions in matching theory,...
AMS Subject Classication: 05C80, 05C70 Abstract. In this paper we study the maximal size of a distan...
Suppose G = (V, E) is a simple graph and k is a fixed positive integer. A subset D subset of V is a ...
By advancing the idea of finding width in bipartite graphs and basic definitions in matching theory,...
We present a quasi linear-time algorithm for Maximum Matching on distance-hereditary graphs and some...
. A new approximation algorithm for maximum weighted matching in general edge-weighted graphs is pre...
We consider a distance generalisation of the strong chromatic index and the maximum induced matching...
Let G = (V ; E) be an undirected graph. Given an odd number k = 2l + 1, a matching M is said to be k...
International audienceBy Berge's theorem, finding a maximum matching in a graph relies on the use of...
In this BSc thesis we focus on one of the most important topics in combinatorial optimization, known...
AbstractWe consider the problem of finding all maximally-matchable edges in a bipartite graph G=(V,E...
In this paper, we consider the minimum maximal matching problem in some classes of graphs such as re...