519:
345:
109:
379:
663:
473:
406:
573:
185:
653:
416:
340:
446:
276:
190:
69:
578:
411:
323:
130:
600:
195:
143:
463:
301:
286:
234:
49:
328:
163:
431:
401:
391:
362:
249:
180:
148:
497:
451:
306:
271:
168:
89:
658:
595:
553:
543:
485:
17:
568:
426:
374:
629:
583:
281:
244:
222:
617:
261:
502:
634:
558:
350:
318:
239:
548:
436:
296:
531:
507:
291:
266:
205:
200:
158:
647:
563:
441:
612:
153:
21:
53:
113:
93:
73:
421:
468:
217:
396:
33:
This category has the following 4 subcategories, out of 4 total.
129:
The following 74 pages are in this category, out of 74 total.
126:
Pages in category "Computational problems in graph theory"
8:
131:This list may not reflect recent changes
520:Quadratic pseudo-Boolean optimization
7:
380:Longest uncrossed knight's path
346:Induced subgraph isomorphism problem
135:
46:
35:
27:
14:
474:Nondeterministic constraint logic
407:Maximum agreement subtree problem
574:Strong connectivity augmentation
186:Deterministic rendezvous problem
417:Maximum common induced subgraph
341:Independent set (graph theory)
1:
447:Mixed Chinese postman problem
277:Graph cuts in computer vision
191:Bipartite realization problem
579:Subgraph isomorphism problem
412:Maximum common edge subgraph
324:Hamiltonian cycle polynomial
601:Travelling salesman problem
196:Digraph realization problem
110:Travelling salesman problem
680:
144:Canadian traveller problem
664:Computational mathematics
464:Network simplex algorithm
302:Graph realization problem
287:Graph isomorphism problem
235:Optimal facility location
329:Hamiltonian path problem
164:Connected dominating set
544:Seidel's algorithm
432:Maximum weight matching
402:Maximal independent set
392:Matching (graph theory)
363:K shortest path routing
250:Frequent subtree mining
181:Degree diameter problem
149:Chinese postman problem
654:Computational problems
498:Pebble motion problems
452:Multi-trials technique
307:Graph sandwich problem
272:Graph cut optimization
169:Correlation clustering
18:computational problems
596:Token reconfiguration
554:Shortest path problem
486:Odd cycle transversal
569:Steiner tree problem
427:Maximum flow problem
375:Longest path problem
70:Network flow problem
16:This category lists
630:Widest path problem
584:Substructure search
282:Graph edit distance
245:Feedback vertex set
223:Edge dominating set
618:Vertex cycle cover
262:Good spanning tree
503:Planarity testing
671:
635:Wiener connector
559:Snake-in-the-box
351:Instant Insanity
319:Hamiltonian path
240:Feedback arc set
115:
95:
75:
55:
50:Graph algorithms
48:
679:
678:
674:
673:
672:
670:
669:
668:
644:
643:
642:
641:
640:
639:
622:
605:
588:
549:Set TSP problem
536:
524:
512:
490:
478:
456:
437:Metric k-center
384:
367:
355:
333:
311:
297:Graph partition
254:
227:
210:
173:
123:
122:
121:
120:
117:
116:
100:
97:
96:
80:
77:
76:
60:
57:
56:
45:
26:
12:
11:
5:
677:
675:
667:
666:
661:
656:
646:
645:
638:
637:
632:
626:
623:
621:
620:
615:
609:
606:
604:
603:
598:
592:
589:
587:
586:
581:
576:
571:
566:
561:
556:
551:
546:
540:
537:
535:
534:
532:Radio coloring
528:
525:
523:
522:
516:
513:
511:
510:
508:Planted clique
505:
500:
494:
491:
489:
488:
482:
479:
477:
476:
471:
466:
460:
457:
455:
454:
449:
444:
439:
434:
429:
424:
419:
414:
409:
404:
399:
394:
388:
385:
383:
382:
377:
371:
368:
366:
365:
359:
356:
354:
353:
348:
343:
337:
334:
332:
331:
326:
321:
315:
312:
310:
309:
304:
299:
294:
292:Graph matching
289:
284:
279:
274:
269:
267:Graph coloring
264:
258:
255:
253:
252:
247:
242:
237:
231:
228:
226:
225:
220:
214:
211:
209:
208:
206:Dominating set
203:
201:Domatic number
198:
193:
188:
183:
177:
174:
172:
171:
166:
161:
159:Clique problem
156:
151:
146:
140:
137:
136:
127:
124:
119:
118:
108:
107:
104:
101:
99:
98:
88:
87:
84:
81:
79:
78:
68:
67:
64:
61:
59:
58:
44:
43:
40:
37:
36:
31:
28:
20:that arise in
13:
10:
9:
6:
4:
3:
2:
676:
665:
662:
660:
657:
655:
652:
651:
649:
636:
633:
631:
628:
627:
624:
619:
616:
614:
611:
610:
607:
602:
599:
597:
594:
593:
590:
585:
582:
580:
577:
575:
572:
570:
567:
565:
564:Spanning tree
562:
560:
557:
555:
552:
550:
547:
545:
542:
541:
538:
533:
530:
529:
526:
521:
518:
517:
514:
509:
506:
504:
501:
499:
496:
495:
492:
487:
484:
483:
480:
475:
472:
470:
467:
465:
462:
461:
458:
453:
450:
448:
445:
443:
442:Minimum k-cut
440:
438:
435:
433:
430:
428:
425:
423:
420:
418:
415:
413:
410:
408:
405:
403:
400:
398:
395:
393:
390:
389:
386:
381:
378:
376:
373:
372:
369:
364:
361:
360:
357:
352:
349:
347:
344:
342:
339:
338:
335:
330:
327:
325:
322:
320:
317:
316:
313:
308:
305:
303:
300:
298:
295:
293:
290:
288:
285:
283:
280:
278:
275:
273:
270:
268:
265:
263:
260:
259:
256:
251:
248:
246:
243:
241:
238:
236:
233:
232:
229:
224:
221:
219:
216:
215:
212:
207:
204:
202:
199:
197:
194:
192:
189:
187:
184:
182:
179:
178:
175:
170:
167:
165:
162:
160:
157:
155:
152:
150:
147:
145:
142:
141:
138:
134:
132:
125:
111:
106:
105:
102:
91:
90:Spanning tree
86:
85:
82:
71:
66:
65:
62:
51:
47:
42:
41:
38:
34:
30:Subcategories
29:
25:
23:
19:
659:Graph theory
613:Vertex cover
154:Clique cover
128:
54:(3 C, 132 P)
32:
22:graph theory
15:
422:Maximum cut
648:Categories
469:Nonblocker
218:Edge cover
397:MaxDDBS
114:(18 P)
94:(39 P)
74:(20 P)
650::
133:.
112:
92:
72:
52:
24:.
625:W
608:V
591:T
539:S
527:R
515:Q
493:P
481:O
459:N
387:M
370:L
358:K
336:I
314:H
257:G
230:F
213:E
176:D
139:C
103:T
83:S
63:N
39:G
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.