7 citations · 17 across the 15 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019
Maximum Weighted Matching with Few Edge Crossings for 2-Layered Bipartite Graph
Kazuya Haraguchi, Kotaro Torii, Motomu Endo
Let c denote a non-negative constant. Suppose that we are given an edge-weighted bipartite graph G=(V,E) with its 2-layered drawing and a family X of intersecting edge pairs. We co…
cs.DM2019
Recycling Solutions for Vertex Coloring Heuristics
Yasutaka Uchida, Kaito Yajima, Kazuya Haraguchi
The vertex coloring problem is a well-known NP-hard problem and has many applications in operations research and in scheduling. A conventional approach to the problem solves the k-…