Diferencia entre revisiones de «Teoría de grafos»
Contenido eliminado Contenido añadido
m Inicio del libro |
Sin resumen de edición |
||
Línea 8:
Un grafo en matemáticas e informática es una generalización del concepto simple de un conjunto de puntos, llamados vértices
==Problemas y algoritmos==
==Problemas y algoritmos==
La teoria de grafos proporciona unas herramientas para resolver problemas que nos presentan cierto tipo de complejidad, y que no se habian podido resolver antes que Euler tratara de dar solucion al problema de los puentes de Konigsberg. se destacan entre ellos los siguientes:
===Coloramiento de grafos===
====El teorema de los cuatro colores====
=====the strong perfect graph theorem=====
=====the Erd\x{0151}s-Faber-Lov\x{00E1}sz conjecture (unsolved)=====
===== the total coloring conjecture (unsolved)=====
===== the list coloring conjecture (unsolved)=====
==== Graph substructure:=====
===== Independent set =====
===== Clique =====
==== Route problems: ====
===== Seven bridges of K\x{00F6}nigsberg =====
===== Minimum spanning tree =====
===== Steiner tree =====
===== Shortest path problem =====
===== Route inspection problem (also called the "Chinese Postman Problem") =====
===== Traveling salesman problem =====
==== Network flows: ====
===== Max flow min cut theorem =====
==== Reconstruction conjecture ====
==== Graph isomorphism problems (Graph matching)====
===== Canonical labeling =====
===== Subgraph isomorphism and monomorphisms =====
===== Maximal common subgraph =====
==== Important algorithms ====
===== Dijkstra's algorithm =====
===== Kruskal's algorithm =====
===== Nearest neighbour algorithm =====
===== Prim's algorithm =====
|