A linear time algorithm for a matching problem on the circle

Fil:Cabrelli, C.A. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.

Guardado en:

Detalles Bibliográficos
Autores principales:	Cabrelli, C.A., Molter, U.M.
Formato:	JOUR
Materias:	Algorithms Computational complexity Minimal matching
Acceso en línea:	http://hdl.handle.net/20.500.12110/paper_00200190_v66_n3_p161_Cabrelli
Aporte de:	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

A linear time algorithm for a matching problem on the circle
por: Cabrelli, Carlos Alberto, et al.
Publicado: (1998)

O(n) time algorithms for dominating induced matching problems
por: Lin, M.C., et al.

O(n) time algorithms for dominating induced matching problems
Publicado: (2014)

Fast algorithms for some dominating induced matching problems
por: Lin, M.C., et al.

Fast algorithms for some dominating induced matching problems
Publicado: (2014)

An O*(1.1939n) time algorithm for minimum weighted dominating induced matching
por: Lin, M.C., et al.

An O*(1.1939n) time algorithm for minimum weighted dominating induced matching
Publicado: (2013)

Approximating weighted induced matchings
por: Lin, M.C., et al.

Approximating weighted induced matchings
Publicado: (2018)

Exact Algorithms for Minimum Weighted Dominating Induced Matching
por: Lin, M.C., et al.

Exact Algorithms for Minimum Weighted Dominating Induced Matching
Publicado: (2017)

Adaptive MCA-Matched Filter Algorithms for Binary Detection
por: Messina, Francisco, et al.
Publicado: (2013)

On improved deformable template matching for polygonal objects
por: Luo, Jianshu, et al.
Publicado: (2004)

An optimal matching problem with constraints
Publicado: (2018)

An optimal matching problem with constraints
por: Mazón, J.M., et al.

Comparison of optimization techniques for automatic history matching
Publicado: (1994)

Comparison of optimization techniques for automatic history matching
por: Savioli, G.B., et al.

An algorithm for the computation of the radical of an ideal
por: Laplagne, Santiago Jorge
Publicado: (2006)

An algorithm for the computation of the radical of an ideal
por: Laplagne, S.

Minimum entropy deconvolution and simplicity: a noniterative algorithm.
por: Cabrelli, C.A.

Web service-based business process automation using matching algorithms
por: Kim, Yanggon, et al.
Publicado: (2006)

An optimal matching problem for the Euclidean distance
por: Rossi, Julio Daniel
Publicado: (2014)

An optimal matching problem for the Euclidean distance
por: Mazón, J.M., et al.

Characterizations and linear time recognition of helly circular-arc graphs
por: Lin, M.C., et al.

Algorithms and ordering heuristics for distributed constraint satisfaction problems
por: Wahbi, Mohamed
Publicado: (2013)

Optimal matching problems with costs given by Finsler distances
por: Rossi, Julio Daniel
Publicado: (2015)

Optimal matching problems with costs given by Finsler distances
por: Mazón, J.M., et al.

A DSATUR-based algorithm for the Equitable Coloring Problem
por: Méndez Díaz, Isabel, et al.
Publicado: (2015)

A DSATUR-based algorithm for the Equitable Coloring Problem
por: Méndez-Díaz, I., et al.

A contrario detection of false matches in iris recognition
Publicado: (2010)

A contrario detection of false matches in iris recognition
por: Mottalli, M., et al.

Algorithms, their complexity and efficiency /
por: Kronsjö, Lydia I.
Publicado: (1979)

A job allocation algorithm for parallel processors
por: Vakhania, Nodari
Publicado: (1997)

Characterizations and linear time recognition of helly circular-arc graphs
por: Lin, Min Chih
Publicado: (2006)

El match de improvisación. Un texto que se expande hacia el futuro
por: Silberstein, Fernando
Publicado: (2005)

Multi-PBil: an estimation distribution algorithm applied to multimodal optimization problems
por: Barbosa Filho, Rubens
Publicado: (2006)

On the time-space complexity of geometric elimination procedures
por: Matera, Guillermo
Publicado: (2001)

On the time-space complexity of geometric elimination procedures
por: Heintz, J., et al.

Parallel algorithms and applications
Publicado: (1993)

The maximum number of dominating induced matchings
por: Lin, M.C., et al.