Generating All Series-Parallel Graphs(<Special Section>Discrete Mathematics and Its Applications)
スポンサーリンク
概要
- 論文の詳細を見る
In this paper we give an algorithm to generates all series-parallel graphs with at most m edges. This algorithm generate each series-parallel graph in constant time on average.
- 社団法人電子情報通信学会の論文
- 2005-05-01
著者
-
KAWANO Shinichiro
Department of Ophthalmology of Teikyo University School of Medicine
-
NAKANO Shinichi
Department of Neurosurgery, Miyazaki Medical College
-
Kawano Shinichiro
Department Of Computer Science Gunma University
-
Nakano Shinichi
Department Of Computer Science Gunma University
関連論文
- Multicenter Genetic Study of Retinitis Pigmentosa in Japan : I. Genetic Heterogeneity in Typical Retinitis Pigmentosa
- Multicenter Genetic Study of Retinitis Pigmentosa in Japan : II. Prevalence of Autosomal Recessive Retinitis Pigmentosa
- Long-term enhancement of synaptic transmission induced by veratridine in rat CA3 hippocampal neurons
- Atypical extraventricular neurocytoma
- Intraneural Synovial Sarcoma Originating From the Median Nerve
- Adenoid glioblastoma arising in a patient with neurofibromatosis type-1
- Mutational analysis of human p53 gene in human gliomas by Cleavase^【○!R】 fragment length polymorphism
- Constant Time Generation of Set Partitions(Selected Papers from the 17th Workshop on Circuits and Systems in Karuizawa)
- Large Cholesterol Granuloma Arising From the Frontal Sinus : Case Report
- Unilateral Middle Cerebral Artery Stenosis in an Adult with Down's Syndrome : Case Report
- Magnetic Resonance Imaging and Angiographic Appearance of Meningioma of the Fourth Ventricle : Two Case Reports
- Pituitary Metastasis of Thyroid Follicular Adenocarcinoma : Case Report
- Meningioma of the Fourth Ventricle : Case Report
- Generating All Series-Parallel Graphs(Discrete Mathematics and Its Applications)