Sciweavers

1395 search results - page 165 / 279
» (k, )-Distance-Hereditary Graphs
Sort
View
EJC
2008
14 years 10 months ago
The distinguishing number of Cartesian products of complete graphs
The distinguishing number D(G) of a graph G is the least integer d such that G has a labeling with d labels that is preserved only by a trivial automorphism. We prove that Cartesi...
Wilfried Imrich, Janja Jerebic, Sandi Klavzar
BMCBI
2004
120views more  BMCBI 2004»
14 years 9 months ago
Clustering under the line graph transformation: application to reaction network
Background: Many real networks can be understood as two complementary networks with two kind of nodes. This is the case of metabolic networks where the first network has chemical ...
Jose C. Nacher, Nobuhisa Ueda, Takuji Yamada, Mino...
RV
2010
Springer
110views Hardware» more  RV 2010»
14 years 8 months ago
Interval Analysis for Concurrent Trace Programs Using Transaction Sequence Graphs
Abstract. Concurrent trace programs (CTPs) are slices of the concurrent programs that generate the concrete program execution traces, where inter-thread event order specific to th...
Malay K. Ganai, Chao Wang
GLOBECOM
2008
IEEE
15 years 4 months ago
A Graph-Based Approach to Multi-Cell OFDMA Downlink Resource Allocation
— A novel, practical and low-complexity multi-cell OFDMA downlink channel assignment method using a graphbased approach is proposed in this work. The inter-cell interference (ICI...
Yu-Jung Chang, Zhifeng Tao, Jinyun Zhang, C. C. Ja...
ESA
2006
Springer
77views Algorithms» more  ESA 2006»
15 years 1 months ago
Traversing the Machining Graph
Abstract. Zigzag pocket machining (or 2D-milling) plays an important role in the manufacturing industry. The objective is to minimize the number of tool retractions in the zigzag m...
Danny Z. Chen, Rudolf Fleischer, Jian Li, Haitao W...