Search Result Save to File Save as CSV
Your search for 12510 returns 844 document(s)
Graph Algorithms: Edge-Disjoint Routing in Plane Switch Graphs in Linear Time
Author: J. M. Hochstein, [et all] | Type: Indeks Artikel Jurnal
Find Similar |  Add To Favorites |  Detail in New Window 
Gracefulness of union of two parth graphs with grid graph and complete bipartite graph
Author: S.K. Vaidya; V.J. Kaneria; Sweta Srivastav, N. A. Dani; | Call Number: SEM-290 | Type: Indeks Artikel prosiding/Sem
Find Similar |  Add To Favorites |  Detail in New Window 
Teaching Graphs of Functions in the Cartesian Plane: Should We Re-think our Approach in Secondary Maths? (346-356)
Author: Jim Claffey; | Call Number: SEM-351 | Type: Indeks Artikel prosiding/Sem
Find Similar |  Add To Favorites |  Detail in New Window 
Graphs and applications: proceedings of the first Colorado symposium on graph theory/ Frank Harary
Call Number: 511.5 Gra | Type: Buku
Find Similar |  Add To Favorites |  Detail in New Window 
Compile-time technique for processors alloaction in macro dataflow graphs for multiprocessors, Hal. II.279-II.283
Author: G.N. Srinivasa Prasanna; Anant Agrawal; | Call Number: SEM-155 | Type: Indeks Artikel prosiding/Sem
Find Similar |  Add To Favorites |  Detail in New Window 
A Compile-time technique for controlling real-time execution of task-level data-flow graphs, Hal. II.49-II.56
Author: Shridhar Shukla and Brian Little; | Call Number: SEM-155 | Type: Indeks Artikel prosiding/Sem
Find Similar |  Add To Favorites |  Detail in New Window 
A Binary linear programming formulations of the graph edit distance, page 1200
Author: D. Justice | Type: Indeks Artikel Jurnal
Find Similar |  Add To Favorites |  Detail in New Window 
A linear graph and genetic algorithm approach for evolving manipulator modelling ( hal 51 - 55 )
Author: Kok Kiong Tan; | Call Number: SEM - 362 | Type: Indeks Artikel prosiding/Sem
Find Similar |  Add To Favorites |  Detail in New Window 
Graph Theory and Combinatorial Structures: An O(log(n)4/3) Space Algorithm for (s,t) Connectivity in Undirected Graphs
Author: R. Armoni, [et all] | Type: Indeks Artikel Jurnal
Find Similar |  Add To Favorites |  Detail in New Window 
A Randomized linear-time algorithm for finding minimum spanning trees,hal 9-15
Author: Philip N.Klein; | Call Number: SEM-202 | Type: Indeks Artikel prosiding/Sem
Find Similar |  Add To Favorites |  Detail in New Window 
Prev   1 2 3 4 5 6 7 8 9 10  Next