scholarly journals TripleEye: Mining Closed Itemsets with Minimum Length Thresholds Based on Ordered Inclusion Tree

2012 ◽  
Vol 5 (0) ◽  
pp. 192-202
Author(s):  
Hiroyuki Shindo ◽  
Tsutomu Hirao ◽  
Jun Suzuki ◽  
Akinori Fujino ◽  
Masaaki Nagata
Keyword(s):  
Minimum Length ◽  
Closed Itemsets

ECCENTRIC SEQUENCE OF GRAPHS

2020 ◽  
Vol 9 (11) ◽  
pp. 9329-9333
Author(s):  
K. Deepika ◽  
K. Suriya ◽  
S. Meenakshi
Keyword(s):  
Minimum Length ◽  
G 11

The minimum length in a graph G between two vertices is defined to be the distance between the two vertices and is denoted by d$\left(a,b\right)$. The farthest vertex distance from a vertex 'a' is known as the eccentricity e(a) of the vertex 'a'. Enumerating the vertex eccentricities in an increasing order is defined as the eccentricity sequence or eccentric sequence of the graph G [11]. The eccentric sequence of some graphs is computed in this paper.

On the minimum length of ternary linear codes

2011 ◽  
Vol 68 (1-3) ◽  
pp. 407-425 ◽  
Author(s):  
Tatsuya Maruta ◽  
Yusuke Oya
Keyword(s):  
Linear Codes ◽  
Minimum Length ◽  
Ternary Linear Codes

Partial job order for solving the two-machine flow-shop minimum-length problem with uncertain processing times

2009 ◽  
Vol 42 (4) ◽  
pp. 1517-1522
Author(s):  
Natalia M. Matsveichuk ◽  
Yuri N. Sotskov ◽  
Frank Werner
Keyword(s):  
Flow Shop ◽  
Minimum Length ◽  
Processing Times

scholarly journals On the minimum length of linear codes over F5

2015 ◽  
Vol 338 (6) ◽  
pp. 938-953 ◽  
Author(s):  
Iliya Bouyukliev ◽  
Yuuki Kageyama ◽  
Tatsuya Maruta
Keyword(s):  
Linear Codes ◽  
Minimum Length
Sign in / Sign up

Export Citation Format

Share Document