Add to ORKG[[sponsorship]]資訊科學研究所,資訊科技創新研究中心[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=Drexel&SrcApp=hagerty_opac&KeyRecord=0178-4617&DestApp=JCR&RQ=IF_CAT_BOXPLO
AbstractInterval graphs play important roles in analysis of DNA chains in Benzer [S. Benzer, On the ...
For n ∈ N, we consider the problem of partitioning the interval [0,n) into k subintervals of positiv...
International audienceAn interval of a permutation is a consecutive substring consisting of consecut...
Given a set of 1D intervals and a desired partition number, this paper studies on how to make an opt...
[[sponsorship]]資訊科學研究所,資訊科技創新研究中心[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com...
We present an algorithm for partitioning the cells of a network into an arbitrary number of segments...
Multi-clique-width is obtained by a simple modification in the definition of clique-width. It has th...
Algorithms for computing or approximating optimal decompositions for decompositional parameters such...
In an earlier work [6] the concept of splitting partition of a graph was introduced in connection wi...
http://deepblue.lib.umich.edu/bitstream/2027.42/4087/5/bam0430.0001.001.pdfhttp://deepblue.lib.umich...
Invited seminar delivered at the ABI (Atelier de BIoinformatique), University Pierre and Marie Curie...
We consider a problem mentioned in [1], which is in partitioning the n-cube in as many sets as possi...
AbstractThe minimum clique partitioning problem in weighted interval graphs (MCPI) is defined as fol...
Clustering, Binary relations, Equivalence relation, Cliques, Combinatorial optimization, Heuristics,...
[[sponsorship]]資訊科學研究所,資訊科技創新研究中心[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com...
AbstractInterval graphs play important roles in analysis of DNA chains in Benzer [S. Benzer, On the ...
For n ∈ N, we consider the problem of partitioning the interval [0,n) into k subintervals of positiv...
International audienceAn interval of a permutation is a consecutive substring consisting of consecut...
Given a set of 1D intervals and a desired partition number, this paper studies on how to make an opt...
[[sponsorship]]資訊科學研究所,資訊科技創新研究中心[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com...
We present an algorithm for partitioning the cells of a network into an arbitrary number of segments...
Multi-clique-width is obtained by a simple modification in the definition of clique-width. It has th...
Algorithms for computing or approximating optimal decompositions for decompositional parameters such...
In an earlier work [6] the concept of splitting partition of a graph was introduced in connection wi...
http://deepblue.lib.umich.edu/bitstream/2027.42/4087/5/bam0430.0001.001.pdfhttp://deepblue.lib.umich...
Invited seminar delivered at the ABI (Atelier de BIoinformatique), University Pierre and Marie Curie...
We consider a problem mentioned in [1], which is in partitioning the n-cube in as many sets as possi...
AbstractThe minimum clique partitioning problem in weighted interval graphs (MCPI) is defined as fol...
Clustering, Binary relations, Equivalence relation, Cliques, Combinatorial optimization, Heuristics,...
[[sponsorship]]資訊科學研究所,資訊科技創新研究中心[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com...
AbstractInterval graphs play important roles in analysis of DNA chains in Benzer [S. Benzer, On the ...
For n ∈ N, we consider the problem of partitioning the interval [0,n) into k subintervals of positiv...
International audienceAn interval of a permutation is a consecutive substring consisting of consecut...