Perfect Graphs
Mostrando 1-6 de 6 artigos, teses e dissertações.
-
1. Lowering costs for large-scale screening in psychosis: a systematic review and meta-analysis of performance and value of information for speech-based psychiatric evaluation
Objective: Obstacles for computational tools in psychiatry include gathering robust evidence and keeping implementation costs reasonable. We report a systematic review of automated speech evaluation for the psychosis spectrum and analyze the value of information for a screening program in a healthcare system with a limited number of psychiatrists (Maputo, M
Braz. J. Psychiatry. Publicado em: 2020-12
-
2. Coloração de arestas em grafos split / Edge-coloring of split graphs
Not informed.
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 28/03/2012
-
3. Problemas em grafos com poucos P4 s em grafos indiferença / Problems on graphs with few P4 s and indifference graphs
Nesta tese de doutoramento sáo considerados três problemas em grafos, para os quais sáo obtidos resultados quando a entrada é restrita a algumas classes. Todos os problemas sáo problemas de otimização combinatória sobre grafos simples e apresentam diferentes classificações de complexidade. Em dois casos, o estudo focou classes de grafos com "poucos
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 19/08/2011
-
4. Orientações pfaffianas e o furtivo grafo de Heawood / Pfaffian orientations and the elusive Heawood graph
A graph G that contains a perfect matching is Pfaffiano if there is an orientation D of the edges of G, such that every conformal circuit of G is oddly oriented in D. A subgraph H of G is conformal if G - V (H) has a perfect matching. A circuit with an even number of edges is oddly oriented if the number of edges whose orientation in D agrees with any sense
Publicado em: 2006
-
5. Codigos sobre grafos que são quocientes de reticulados
Graphs which are quotients of lattices are studied in this dissertation and some of their connections to error correcting codes are explored. The text is organized as follows. In Chapter 1 the main concepts and results in Graph theory are introduced. Chapter 2 contains s brief introduction to error correcting codes theory and Chapter 3 is devoted to the stud
Publicado em: 2004
-
6. Decomposição otima em orelhas para grafos matching covered
Matching covered graphs are connected graphs in which every edge lies in a perfect matching. The base of this theory was developed by L. Lovász, and as consequence, a characterization to the matching lattice was obtained. Then it was possible to obtain a proof for a relaxation of a conjecture of Tutte, which is related to the four colors problem. There are
Publicado em: 1996