Št. zadetkov: 62
Ni določena
Oznake:
matematika;teorija grafov;vložitev;hiperkocka;algoritem;mathematics;graph theory;embedding;complete binary tree;hypercube;algorithm;
A new simple algorithm for optimal embedding of complete binary trees into hypercubes as well as a node-by-node algorithm for embedding of nearly complete binary trees into hypercubes are presented.
Leto:
2010
Vir:
Fakulteta za naravoslovje in matematiko (UM FNM)
Recenzija, prikaz knjige, kritika
Oznake:
matematika;teorija grafov;računalništvo;stopnja aproksimacije;problem maksimizacije;mathematics;graph theory;computer science;weighted hereditary induced-subgraph maximization problems;
Demange, Marc; Paschos, Vangelis (F-PARIS9-LA): Improved approximations for weighted and unweighted graph problems. (English. English summary. - Theory Comput. Syst. 38 (2005), no. 6, 763--787.
Leto:
2006
Vir:
Pedagoška fakulteta (UM PEF)
Recenzija, prikaz knjige, kritika
Oznake:
Vikas, Narayan (3-SFR-SC): A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results. (English summary). - J. Comput. System Sci. 71 (2005), no. 4, 406--439
Leto:
2006
Vir:
Fakulteta za naravoslovje in matematiko (UM FNM)
Recenzija, prikaz knjige, kritika
Oznake:
Lozin, V. V. (1-RTG-OR); Rautenbach, D. (D-BONN-DM): The tree- and clique-width of bipartite graphs in special classes. (English summary). - Australas. J. Combin. 34 (2006), 57--67
Leto:
2007
Vir:
Fakulteta za naravoslovje in matematiko (UM FNM)
Recenzija, prikaz knjige, kritika
Oznake:
Campbell, Ann Melissa (1-IA-MG); Lowe, Timothy J. (1-PAS-SIB); Zhang, Li (1-CITA): Upgrading arcs to minimize the maximum travel time in a network. (English summary). - Networks 47 (2006), no. 2, 72--80
Leto:
2007
Vir:
Fakulteta za naravoslovje in matematiko (UM FNM)
Recenzija, prikaz knjige, kritika
Oznake:
Yan, Weigen (PRC-JMU-SS); Yeh, Yeong-Nan (RC-AST): Connections between Wiener index and matchings. (English summary). - J. Math. Chem. 39 (2006), no. 2, 389--399
Leto:
2006
Vir:
Fakulteta za naravoslovje in matematiko (UM FNM)
Recenzija, prikaz knjige, kritika
Oznake:
Küpper, Beate (D-AACH-M2); Volkmann, Lutz (D-AACH-M2): Upper bounds on the domination number of a graph in terms of order, diameter and minimum degree. (English summary). - Australas. J. Combin. 35 (2006), 133--140
Leto:
2007
Vir:
Fakulteta za naravoslovje in matematiko (UM FNM)
Recenzija, prikaz knjige, kritika
Oznake:
Lozin, Vadim V. (1-RTG-OR); Mosca, Raffaele (I-DAN2-SC): Polar graphs and maximal independent sets. (English summary). - Discrete Math. 306 (2006), no. 22, 2901--2908
Leto:
2008
Vir:
Fakulteta za naravoslovje in matematiko (UM FNM)
Recenzija, prikaz knjige, kritika
Oznake:
Escoffier, Bruno (F-PARIS9-LA); Paschos, Vangelis Th. (F-PARIS9-LA): On-line models and algorithms for max independent set. (English summary). - RAIRO Oper. Res. 40 (2006), no. 2, 129--142
Leto:
2007
Vir:
Fakulteta za naravoslovje in matematiko (UM FNM)
Recenzija, prikaz knjige, kritika
Oznake:
Ghosh, Prabir K. (6-VIDY-AMO); Pal, Madhumangal (6-VIDY-AMO): An optimal algorithm to solve 2-neighbourhood covering problem on trapezoid graphs. (English summary). - Adv. Model. Optim. 9 (2007), no. 1, 15--36 (electronic)
Leto:
2008
Vir:
Fakulteta za naravoslovje in matematiko (UM FNM)