Efficient maximum matching algorithms for trapezoid graphs
Trapezoid graphs are intersection graphs of trapezoids between two horizontal lines. Many NP-hard problems can be solved in polynomial time if they are restricted on trapezoid graphs. A matching in a graph is a set of pairwise disjoint edges, and a maximum matching is a matching of maximum size. In...
Na minha lista:
| Principais autores: | , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2017-04-01
|
| coleção: | Electronic Journal of Graph Theory and Applications |
| Assuntos: | |
| Acesso em linha: | http://www.ejgta.org/index.php/ejgta/article/view/273 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|