Problemas

Bicoloración

Valladolid:

10004 - Bicoloring

Ural:

1080 - Map Colouring

Ordenamiento topológico (Topological sort)

Valladolid:

200 - Rare Order
10305 - Ordering Tasks

Ural:

1022 - Genealogical tree

Project Euler:

Problem 79

Camino más corto: Dijkstra

Valladolid:

186 - Trip Routing
336 - A Node Too Far
423 - MPI Maelstrom
709 - Formatting Text
762 - We Ship Cheap
10044 - Erdos Numbers
10239 - The Book-shelver's Problem
10594 - Data Flow
10801 - Lift Hopping
10959 - The Party, Part I
10967 - The Great Escape
10968 - KuPellaKeS
10986 - Sending email
11018 - Mars Buggy

Ural:

1205 - Underground

Camino más corto para cada pareja: Floyd-Warshall

Valladolid:

104 - Arbitrage
383 - Shipping Routes
567 - Risk
821 - Page Hopping
10171 - Meeting Prof. Miguel...
10803 - Thunder Mountain
10926 - How Many Dependencies?

Zhejiang:

1221 - Risk

World Archive:

2879 - Emergency services

Árboles mínimos generadores (MST – Minimum Spanning Tree): Prim y Kruskal

Valladolid:

10034 - Freckles
10147 - Highways
10307 - Killing Aliens in Borg Maze
10369 - Arctic Network
10397 - Connect the Campus
10457 - Magic Car
10462 - Is There A Second Way Left?
10600 - ACM Contest and Blackout
10816 - Travel in Desert

Project Euler:

Problem 103

World Archive:

2515 - Networking

Camino Euleriano (algoritmo de Fleury)

Valladolid:

10735 - Euler Circuit

Saratov:

101 - Domino

Puntos de articulación (vértices de corte)

Valladolid:

315 - Network
796 - Critical Links
10199 - Tourist Guide

Camino más corto en DAGs (Directed acyclic graphs - Gráficas dirigidas acíclicas)

Valladolid:

452 - Project Scheduling

Ural:

1210 - Kind spirits

Cerradura transitiva (Warshall)

Valladolid:

334 - Identifying Concurrent Events
10266 - Surveying

Mini-max y Maxi-min

Valladolid:

534 - Frogger
544 - Heavy Cargo
10048 - Audiophobia
10099 - The Tourist Guide

Camino más corto con ciclos negativos (Bellman-Ford)

Valladolid:

558 - Wormholes

Flujo máximo: Ford-Fulkerson

Valladolid:

563 - Crimewave
820 - Internet Bandwidth
10330 - Power Transmission
10380 - Shogi Tournament
10511 - Councilling
10779 - Collectors Problem

Camino Hamiltoniano (agente viajero)

Valladolid:

10506 - The Ouroboros problem

Estructuras de conjuntos disconexos (disjoint-sets) en bosques

Valladolid:

459 - Graph Connectivity

Gráfica Bipartita (Maximum Bipartite Matching)

Valladolid:

259 - Software Allocation
663 - Sorting Slides
670 - The dog task
753 - A Plug for UNIX
10080 - Gopher II
10092 - The Problem with the Problem Setter
10122 - Mysterious Mountain
10243 - Fire! Fire!! Fire!!!
10418 - Hyper Toy Soldiers
10746 - Crime Wave - The Sequel
10804 - Gopher Strategy
10888 - Warehouse
10984 - Double NP-hard

Zhejiang:

2362 - Beloved Sons

Componentes Fuertemente Conectadas (SCC – Strongly Connected Component)

Valladolid:

793 - Network Connections
10319 - Manhattan
10505 - Montesco vs Capuleto
10510 - Cactus
10779 - Collectors Problem
10972 - RevolC FaeLoN

General

Valladolid:

193 - Graph Coloring
572 - Oil Deposits
677 - All Walks of length "n" from the first node
10178 - Count the Faces
10480 - Sabotage
10596 - Morning Walk
10806 - Dijkstra, Dijkstra
10982 - Troublemakers
10983 - Buy one, get the rest free
10985 - Rings'n'Ropes
10987 - Antifloyd
10988 - From G to H and back
10989 - Bomb, Divide and Conquer