11 pages matching sorting network in this book
Results 1-3 of 11
What people are saying - Write a review
We haven't found any reviews in the usual places.
Bounds for the ifcNode Operating Component Reliability Model
Domination in Oriented Graphs by Bila Bollobds and Tamds Szabo
7 other sections not shown
a-stable adjacency matrix adjacent algorithm assume At(G bipartite graph blocks CCE-orientable cell chordal chordal graph column com(T Combinatorial common distance-preserving subgraph competition graph complete graph components Computing CONGRESSUS NUMERANTIUM connected graph construction contains Corollary cycle cyclic defined deletion denote digraph disjoint edge elements embedding entries example exists Figure Gj and G2 graph G Graph Theory greatest common distance-preserving hanging planter Hence hypergraphs implies independent set induced subgraph intersections interval graph isolated vertices isomorphic knight's tour labeled latin squares least Lemma Let G line digraph lower bound Math matrix maximum multigraph nodes NP-complete NP-hard number of G obtained optimal orbit parameters partition path positive integer problem Proof Proposition result sequence Sheffer sequences sorting network spanning tree stability system subgraph of Gj subset Suppose Theorem total dominating set tournament triangle unique upper bound graph values vertex of degree vertex set zigzag number