Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Kernighan–Lin_algorithm> ?p ?o }
Showing triples 1 to 34 of
34
with 100 triples per page.
- Kernighan–Lin_algorithm abstract "This article is about the heuristic algorithm for the graph partitioning problem. For a heuristic for the traveling salesperson problem, see Lin–Kernighan heuristic.Kernighan–Lin is a O(n2 log(n)) heuristic algorithm for solving the graph partitioning problem. The algorithm has important applications in the layout of digital circuits and components in VLSI.".
- Kernighan–Lin_algorithm wikiPageID "23174224".
- Kernighan–Lin_algorithm wikiPageLength "3375".
- Kernighan–Lin_algorithm wikiPageOutDegree "7".
- Kernighan–Lin_algorithm wikiPageRevisionID "649732665".
- Kernighan–Lin_algorithm wikiPageWikiLink Category:Combinatorial_algorithms.
- Kernighan–Lin_algorithm wikiPageWikiLink Category:Combinatorial_optimization.
- Kernighan–Lin_algorithm wikiPageWikiLink Category:Heuristic_algorithms.
- Kernighan–Lin_algorithm wikiPageWikiLink Graph_partition.
- Kernighan–Lin_algorithm wikiPageWikiLink Graph_partitioning_problem.
- Kernighan–Lin_algorithm wikiPageWikiLink Heuristic_(computer_science).
- Kernighan–Lin_algorithm wikiPageWikiLink Heuristic_algorithm.
- Kernighan–Lin_algorithm wikiPageWikiLink Lin–Kernighan_heuristic.
- Kernighan–Lin_algorithm wikiPageWikiLink VLSI.
- Kernighan–Lin_algorithm wikiPageWikiLink Very-large-scale_integration.
- Kernighan–Lin_algorithm wikiPageWikiLinkText "K-L heuristic".
- Kernighan–Lin_algorithm wikiPageWikiLinkText "Kernighan–Lin algorithm".
- Kernighan–Lin_algorithm wikiPageWikiLinkText "Kernighan–Lin algorithm".
- Kernighan–Lin_algorithm hasPhotoCollection Kernighan–Lin_algorithm.
- Kernighan–Lin_algorithm wikiPageUsesTemplate Template:Reflist.
- Kernighan–Lin_algorithm subject Category:Combinatorial_algorithms.
- Kernighan–Lin_algorithm subject Category:Combinatorial_optimization.
- Kernighan–Lin_algorithm subject Category:Heuristic_algorithms.
- Kernighan–Lin_algorithm comment "This article is about the heuristic algorithm for the graph partitioning problem. For a heuristic for the traveling salesperson problem, see Lin–Kernighan heuristic.Kernighan–Lin is a O(n2 log(n)) heuristic algorithm for solving the graph partitioning problem. The algorithm has important applications in the layout of digital circuits and components in VLSI.".
- Kernighan–Lin_algorithm label "Kernighan–Lin algorithm".
- Kernighan–Lin_algorithm sameAs Kernighan-Lin-Algorithmus.
- Kernighan–Lin_algorithm sameAs Algoritmo_di_Kernighan-Lin.
- Kernighan–Lin_algorithm sameAs Kernighan-Lin.
- Kernighan–Lin_algorithm sameAs Algorytm_Kernighana-Lina.
- Kernighan–Lin_algorithm sameAs m.064prsg.
- Kernighan–Lin_algorithm sameAs Q2802593.
- Kernighan–Lin_algorithm sameAs Q2802593.
- Kernighan–Lin_algorithm wasDerivedFrom Kernighan–Lin_algorithm?oldid=649732665.
- Kernighan–Lin_algorithm isPrimaryTopicOf Kernighan–Lin_algorithm.