Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Szymanskis_conjecture> ?p ?o }
Showing triples 1 to 34 of
34
with 100 triples per page.
- Szymanskis_conjecture abstract "In mathematics, Szymanski's conjecture, named after Ted H. Szymanski (1989), states that every permutation on the n-dimensional doubly directed hypercube graph can be routed with edge-disjoint paths. That is, if the permutation σ matches each vertex v to another vertex σ(v), then for each v there exists a path in the hypercube graph from v to σ(v) such that no two paths for two different vertices u and v use the same edge in the same direction.Through computer experiments it has been verified that the conjecture is true for n ≤ 4 (Baudon, Fertin & Havel 2001). Although the conjecture remains open for n ≥ 5, in this case there exist permutations that require the use of paths that are not shortest paths in order to be routed (Lubiw 1990).".
- Szymanskis_conjecture wikiPageID "25435956".
- Szymanskis_conjecture wikiPageLength "1955".
- Szymanskis_conjecture wikiPageOutDegree "8".
- Szymanskis_conjecture wikiPageRevisionID "577623475".
- Szymanskis_conjecture wikiPageWikiLink Category:Conjectures.
- Szymanskis_conjecture wikiPageWikiLink Category:Graph_theory.
- Szymanskis_conjecture wikiPageWikiLink Category:Network_topology.
- Szymanskis_conjecture wikiPageWikiLink Directed_graph.
- Szymanskis_conjecture wikiPageWikiLink Hypercube_graph.
- Szymanskis_conjecture wikiPageWikiLink Path_(graph_theory).
- Szymanskis_conjecture wikiPageWikiLink Permutation.
- Szymanskis_conjecture wikiPageWikiLink Shortest_path_problem.
- Szymanskis_conjecture wikiPageWikiLinkText "Szymanski's conjecture".
- Szymanskis_conjecture wikiPageUsesTemplate Template:Citation.
- Szymanskis_conjecture wikiPageUsesTemplate Template:Combin-stub.
- Szymanskis_conjecture wikiPageUsesTemplate Template:Harv.
- Szymanskis_conjecture wikiPageUsesTemplate Template:Harvs.
- Szymanskis_conjecture subject Category:Conjectures.
- Szymanskis_conjecture subject Category:Graph_theory.
- Szymanskis_conjecture subject Category:Network_topology.
- Szymanskis_conjecture type Combinatoric.
- Szymanskis_conjecture type Conjecture.
- Szymanskis_conjecture type Field.
- Szymanskis_conjecture type Relation.
- Szymanskis_conjecture type Statement.
- Szymanskis_conjecture type Statement.
- Szymanskis_conjecture comment "In mathematics, Szymanski's conjecture, named after Ted H. Szymanski (1989), states that every permutation on the n-dimensional doubly directed hypercube graph can be routed with edge-disjoint paths.".
- Szymanskis_conjecture label "Szymanski's conjecture".
- Szymanskis_conjecture sameAs Q7665039.
- Szymanskis_conjecture sameAs m.09k4tmh.
- Szymanskis_conjecture sameAs Q7665039.
- Szymanskis_conjecture wasDerivedFrom Szymanskis_conjecture?oldid=577623475.
- Szymanskis_conjecture isPrimaryTopicOf Szymanskis_conjecture.