|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | (n,m)-graphs with maximum sum of squares of degrees显示文摘 | PELED U PETRESCHI R STERBINI A | 1999 | Graph Theory1999，31，： | 1 |
| 2 | Computing Prufer codes efficiently in parallel显示文摘 | Greenlaw R Petreschi R | | 0，，03： | 1 |
| 3 | Labeling trees with a condition at distance two 显示文摘 | Calamoneri T Pelc A Petreschi R | 2006 | Discrete Mathematics2006，306，14： | 1 |
| 4 | L( h, 1 ) - labeling subclasses of planar graphs 显示文摘 | CALAMONERI T PETRESCHI R | 2004 | J Parallel and Distributed Computing2004，64，： | 1 |
| 5 | At most single-bend embeddings of cubic graphs显示文摘 | Liu Yanpei P. Marchioro R. Petreschi | 1994 | Applied Mathematics1994，，2： | 1 |
| 6 | 三正则图的至多单折纵横嵌入显示文摘This paper provides the complete proof of the fact that any planar cubic graph isat most slngle-bend embeddable except for the tetrabedrou. An O(n) amortized time algorithm for drawing an at most single-bend embedding of a cubic graph'.is also presented, where n is the number of vertices of the graph. Furthermore, it is proved that the minimum of the total number of bends in an at most slngle-bend embedding of a cubic graph of order n is less than or equal to 0.5n+1. This result is the best possible. | 刘彦佩 Marchioro,P. Petreschi,R. | 1994 | Applied Mathematics(A Journal of Chinese Universities)1994，9，2： | 0 |
| 7 | A General Approach to L(h,k)-Label Interconnection Networks显示文摘给二个非否定的整数 h 和 k , L ( h , k )图G = 标记( V , E )是从集合 V 的功能到一套颜色,以便相邻节点在距离拿颜色至少 h ,在距离 2 点的'与'节点在距离拿颜色至少 k 。L 的目的(h, k ) 把问题标记是最小化最大的使用颜色。因为这个问题的 decisional 版本是 NP 完全的,调查这个问题能高效地为被解决的图的特别的班是重要的。它是众所周知的最普通的互连布局,例如像蝴蝶,祈祷· s, CCC,三价的 Cayley 网络,都被类似的结构描绘:他们把节点作为一个矩阵组织了,连接被划分成层。因此我们自然地介绍图的一个新班,打电话(l × n ) 多级式的图,包含最普通的互连布局,我们在上学习 L (h, k ) 标记。为 L 的一个一般算法(h, k ) 把这些图标记被介绍,并且从这个方法有效 L (2, 1 ) 为蝴蝶和 CCC 标记被导出。最后,我们描述我们的途径的可能的归纳。 | Tiziana Calamoneri Saverio Caminiti Rossella Petreschi | 2008 | Journal of Computer Science & Technology2008，23，4： | 0 |
| 8 | THEORETICAL RESULTS ON AT MOST 1-BEND EMBEDDABILITY OF GRAPHS显示文摘1. Introduction Let κ be a non-negative integer. A κ-bend graph is a plane graph in which every edgeis a broken line consisting of at most κ+ 1 horizontal or vertical segments. A bend is any point which is the intersection of a horizontal segment and a verticalsegment of an edge. A planar graph G is κ-rectilinear if it admits a plane embedding Gwhich is a κ-bend graph. In this case G is said to be a κ-embedding of G. | 刘彦佩 PAOLA MARCHIORO ROSSELLA PETRESCHI BRUNO SIMEONE | 1992 | Acta Mathematicae Applicatae Sinica1992，8，2： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员