Enumeration - PDFSEARCH.IO - Document Search Engine

Enumeration
Results: 726

#	Item
131	Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs Yoshio Okamoto∗, Takeaki Uno†, and Ryuhei Uehara‡ Abstract We study some counting and enumeration problems for chordal graphs, especially conce Add to Reading List Source URL: www.jaist.ac.jp Language: English - Date: 2005-06-29 11:34:43
132	(C) Springer Verlag, Lecture Notes on Computer Science A New Approach for Speeding Up Enumeration Algorithms Takeaki UNO Dept. Industrial Engineering and Management, Tokyo Institute of Technology, Add to Reading List Source URL: research.nii.ac.jp Language: English - Date: 2010-09-24 01:42:13
133	Enumeration and shape of 1324-avoiding permutations A permutation π ∈ Sn is said to avoid a pattern σ ∈ Sk if there is no increasing subsequence 1 ≤ i1 < · · · < ik ≤ n such that the subsequence (πi1 , . . Add to Reading List Source URL: mssi2015.files.wordpress.com Language: English - Date: 2015-08-17 11:35:28
134	An Efficient Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence Hiroki Arimura1? and Takeaki Uno2 1 Add to Reading List Source URL: research.nii.ac.jp Language: English - Date: 2010-06-28 00:10:20
135	Parallel Shortest Lattice Vector Enumeration on Graphics Cards Jens Hermans1 Johannes Buchmann2 Bart Preneel1 Add to Reading List Source URL: 2010.africacrypt.com Language: English - Date: 2010-05-03 02:39:46
136	Ambiguous Frequent Itemset Mining and Polynomial Delay Enumeration Takeaki Uno1 and Hiroki Arimura2 1 2 Add to Reading List Source URL: research.nii.ac.jp Language: English - Date: 2010-09-24 01:42:11
137	Programa de Doctorat de Matemàtica Aplicada Random Combinatorial Structures with low dependencies: existence and enumeration by Add to Reading List Source URL: www-ma4.upc.edu Language: English - Date: 2013-12-13 07:10:06
138	DMTCS proc. AS, 2013, 253–264 FPSAC 2013 Paris, France Structure and enumeration of (3 + 1)-free posets (extended abstract) Add to Reading List Source URL: thales.math.uqam.ca Language: English - Date: 2014-02-06 05:46:06
139	Polynomial Space and Delay Algorithms for Enumeration of Maximal Motifs in a Sequence Hiroki Arimura1? and Takeaki Uno2 1 Hokkaido University, Kita 14-jo, Nishi 9-chome, Sapporo, JAPAN Add to Reading List Source URL: research.nii.ac.jp Language: English - Date: 2010-06-28 00:10:20
140	PATTERN AVOIDANCE IN BINARY TREES ERIC S. ROWLAND Abstract. This paper considers the enumeration of trees avoiding a contiguous pattern. We provide an algorithm for computing the generating function that counts n-leaf bi Add to Reading List Source URL: thales.math.uqam.ca Language: English - Date: 2010-02-09 16:36:37

UPDATE