Buscar
Mostrando ítems 41-50 de 1376
Coloração de arestas em grafos split-comparabilidade e split-intervalos
(Universidade Tecnológica Federal do ParanáPonta GrossaBrasilPrograma de Pós-Graduação em Ciência da ComputaçãoUTFPR, 2021-04-20)
A proper edge coloring of a graph is an assignment of colors to its edges such that edges incident with the same vertex have distinct colors. The Edge Coloring Problem is answering, given a graph, which is the least number ...
Graphs with independent perfect matchings
(John Wiley & Sons IncHobokenEUA, 2005)
Geodesics and Almost Geodesic Cycles in Random Regular Graphs
(JOHN WILEY & SONS INC, 2011)
A geodesic in a graph G is a shortest path between two vertices of G. For a specific function e(n) of n, we define an almost geodesic cycle C in G to be a cycle in which for every two vertices u and v in C, the distance ...
Ramsey(3,3,3)>16
(2016)
Automatic theory formation in graph theory
(Sociedade Brasileira de Computação, 1999)
Spectral Graph Analysis for Process Monitoring
(American Chemical Society, 2014-05)
Process monitoring is a fundamental task to support operator decisions under ab- normal situations. Most process monitoring approaches, such as Principal Components Analysis and Locality Preserving Projections, are based ...