AbstractWe present an O(n2)-time algorithm for computing a maximum cardinality induced matching and a minimum cardinality cover by chain subgraphs for convex bipartite graphs. This improves the previous time bound of O(m2)
Finding maximum-cardinality matchings in undirected graphs is arguably one of the most central graph...
By advancing the idea of finding width in bipartite graphs and basic definitions in matching theory,...
Let G = (V ; E) be an undirected graph. Given an odd number k = 2l + 1, a matching M is said to be k...
AbstractWe present an O(n2)-time algorithm for computing a maximum cardinality induced matching and ...
A bipartite graph G=(U,V,E) is convex if the vertices in V can be linearly ordered such that for eac...
AbstractThe k-chain subgraph cover problem asks if the edge set of a given bipartite graph G is the ...
AbstractThe problem of determining the maximum matching in a convex bipartite graph, G = (V1, V2, E)...
A bipartite graph G=(A, B, E) is convex on B if there exists an ordering of the vertices of B such t...
AbstractLet G(V1, V2, E) be a bipartite graph and for each edge e ∈ E a weight We is prescribed. The...
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartit...
In this BSc thesis we focus on one of the most important topics in combinatorial optimization, known...
The dominating induced matching problem is the problem of determining whether a graph has an induced...
Abstract. We consider the problem of maintaining a maximum matching in a convex bipartite graph G = ...
Abstract. König’s theorem states that on bipartite graphs the size of a maximum matching equals the...
. For a graph G with e edges and n vertices, and w(E) as a total edge weight, a maximum cardinality ...
Finding maximum-cardinality matchings in undirected graphs is arguably one of the most central graph...
By advancing the idea of finding width in bipartite graphs and basic definitions in matching theory,...
Let G = (V ; E) be an undirected graph. Given an odd number k = 2l + 1, a matching M is said to be k...
AbstractWe present an O(n2)-time algorithm for computing a maximum cardinality induced matching and ...
A bipartite graph G=(U,V,E) is convex if the vertices in V can be linearly ordered such that for eac...
AbstractThe k-chain subgraph cover problem asks if the edge set of a given bipartite graph G is the ...
AbstractThe problem of determining the maximum matching in a convex bipartite graph, G = (V1, V2, E)...
A bipartite graph G=(A, B, E) is convex on B if there exists an ordering of the vertices of B such t...
AbstractLet G(V1, V2, E) be a bipartite graph and for each edge e ∈ E a weight We is prescribed. The...
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartit...
In this BSc thesis we focus on one of the most important topics in combinatorial optimization, known...
The dominating induced matching problem is the problem of determining whether a graph has an induced...
Abstract. We consider the problem of maintaining a maximum matching in a convex bipartite graph G = ...
Abstract. König’s theorem states that on bipartite graphs the size of a maximum matching equals the...
. For a graph G with e edges and n vertices, and w(E) as a total edge weight, a maximum cardinality ...
Finding maximum-cardinality matchings in undirected graphs is arguably one of the most central graph...
By advancing the idea of finding width in bipartite graphs and basic definitions in matching theory,...
Let G = (V ; E) be an undirected graph. Given an odd number k = 2l + 1, a matching M is said to be k...
DOI
Add to ORKG
