Buscar
Mostrando ítems 21-30 de 800
Multilevel refinement based on neighborhood similarity
(Association for Computing Machinery - ACMInstituto Superior de Engenharia do Porto - ISEPPorto, 2014-07)
The multilevel graph partitioning strategy aims to reduce the computational cost of the partitioning algorithm by applying it on a coarsened version of the original graph. This strategy is very useful when large-scale ...
The Graph Sandwich Problem for P-4-sparse graphs
(Elsevier Science BvAmsterdamHolanda, 2009)
Instance-optimal geometric algorithms
(ACM, 2017)
We prove the existence of an algorithmAfor computing 2D or 3D convex hulls that is optimal forevery pointsetin the following sense: for every sequenceσofnpoints and for every algorithmA′in a certain classA,the running time ...
A branch-and-price approach for the partition coloring problem
(Elsevier Science BvAmsterdamHolanda, 2011)
Minimum Stabbing Rectangular Partitions Of Rectilinear Polygons
(Pergamon-Elsevier Science LTDOxford, 2017)
Low-Exponential Algorithm for Counting the Number of Edge Cover on Simple Graphs
(Instituto Politécnico Nacional, 2017)
Low-Exponential Algorithm for Counting the Number of Edge Cover on Simple Graphs
(Computación y Sistemas, 2017)