Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Constrained matching problems in bipartite graphs
We study the following generalization of maximum matchings in bipartite graphs: given a
bipartite graph such that each edge has a unique color cj, we are asked to find a maximum …
bipartite graph such that each edge has a unique color cj, we are asked to find a maximum …
Approximation algorithms for bounded color matchings via convex decompositions
G Stamoulis - … Symposium on Mathematical Foundations of Computer …, 2014 - Springer
We study the following generalization of the maximum matching problem in general graphs:
Given a simple non-directed graph G=(V, E) and a partition of the edges into k classes (ie E …
Given a simple non-directed graph G=(V, E) and a partition of the edges into k classes (ie E …
[HTML][HTML] Bi-criteria and approximation algorithms for restricted matchings
In this work we study approximation algorithms for the Restricted matching problem which is
defined as follows: given a graph in which each edge e has a color ce and a profit pe∈ Q+ …
defined as follows: given a graph in which each edge e has a color ce and a profit pe∈ Q+ …
Graph orientations optimizing the number of light or heavy vertices
This paper introduces four graph orientation problems named Maximize W-Light, Minimize
W-Light, Maximize W-Heavy, and Minimize W-Heavy, where W can be any fixed non …
W-Light, Maximize W-Heavy, and Minimize W-Heavy, where W can be any fixed non …
[PDF][PDF] Approximation algorithms for bounded color matchings via convex decompositions
S Georgios - … on Mathematical Foundations of Computer Science …, 2014 - researchgate.net
We study the following generalization of the maximum matching problem in general graphs:
Given a simple non-directed graph G=(V, E) and a partition of the edges into k classes (ie E …
Given a simple non-directed graph G=(V, E) and a partition of the edges into k classes (ie E …
Mathematical Foundations of Computer Science 2014 LNCS 8635
E Csuhaj-Varjú, M Dietzfelbinger, Z Ésik - Springer
The series of MFCS symposia has a long and well-established tradition. The MFCS
conferences encourage high-quality research into all branches of theoretical computer …
conferences encourage high-quality research into all branches of theoretical computer …