No.427

Applied Combinatorial Theory and Algorithms

1980/12/08～1980/12/09

Ｏｚａｗａ，Ｔａｋａｏ

OZAWA,TAKAO

目　次

1. On the Mapping Data of Planar Graphs (Applied Combinatorial Theory and Algorithms)------------------------------------------------1

　　　　Department of Electrical Engineering, Kyoto University　　　OZAWA,TAKAO

2. A Graph Theoretical Approach to the Permutation Layout (Applied Combinatorial Theory and Algorithms)-----------------------------15

　　　　Department of Electronic Engineering, Faculty of Engineering, Osaka University / Department of Electrical Engineering and Computer Sciences, University of California / Department of Electronic Engineering, Faculty of Engineering, Osaka University　　　TSUKIYAMA,S. / KUH,E.S. / SHIRAKAWA,I.

3. Theory of Hypermatroids (Applied Combinatorial Theory and Algorithms)------------------------------------------------------------43

　　　　Graduate School of Science and Engineering, Tokyo Institute of Technology　　　TOMIZAWA,NOBUAKI

4. References on Dissection (Applied Combinatorial Theory and Algorithms)-----------------------------------------------------------51

　　　　Department of Combinatorics and Optimization, Faculty of Mathematics, University of Waterloo　　　TUTTE,W.T.

5. A Class of Recurrence Relations on Acyclic Digraphs of Poset Type (Applied Combinatorial Theory and Algorithms)------------------56

　　　　Department of Mathematical Sciences, Faculty of Science, Tokai University　　　NARUSHIMA,HIROSHI

6. Miscellaneous Properties on Equi-Eccentric Graphs (Applied Combinatorial Theory and Algorithms)----------------------------------68

　　　　Dept. of Fundamental Sciences, Nippon Ika University / Dept. of Fundamental Sciences, Nippon Ika University / Dept. of Computer Sciences, McGill University　　　AKIYAMA,JIN / ANDO,KIYOSHI / AVIS,DAVID

7. A Minimum Cost Flow Algorithm in a Disjunctive Network (Applied Combinatorial Theory and Algorithms)-----------------------------83

　　　　Tokyo University of Agriculture and Technology　　　NAKAMORI,MARIO

8. Data Flow Analysis of Program Nets (Applied Combinatorial Theory and Algorithms)-------------------------------------------------98

　　　　Hiroshima University, Faculty of Engineering　　　ONAGA,KENJI

9. A Heuristic Algorithm for the Minimum Feedback Arc Set Problem (Applied Combinatorial Theory and Algorithms)--------------------112

　　　　Department of Electrical Engineering, Faculty of Engineering, Ehime University / Computer Center, Ehime University　　　ARIYOSHI,HIROMU / HIGASHIYAMA,YOUICHI

10. On Common Sequence Problems (Applied Combinatorial Theory and Algorithms)------------------------------------------------------131

　　　　Faculty of Engineering, Hiroshima University / Faculty of Engineering, Hiroshima University / Faculty of Engineering, Hiroshima University　　　KIKUNO,TOHRU / YOSHIDA,NORIYOSHI / WAKABAYASHI,SHIN'ICHI

11. Applications of the Lipton and Tarjan's Planar Separator Theorem (Applied Combinatorial Theory and Algorithms)-----------------148

　　　　Department of Electrical Communications, Faculty of Engineering, Tohoku University / Department of Electrical Communications, Faculty of Engineering, Tohoku University / Department of Electrical Communications, Faculty of Engineering, Tohoku University　　　CHIBA,NORISHIGE / NISHIZEKI,TAKAO / SAITO,NOBUJI

12. Scheduling in File Processing and Related Problems (Applied Combinatorial Theory and Algorithms)-------------------------------165

　　　　Dept. of Elec. Eng., University of Waterloo　　　KAMEDA,T.

13. Subset Graphs and Their Applications to Databases (Applied Combinatorial Theory and Algorithms)--------------------------------175

　　　　Department of Information Science, Kyoto University　　　KAMBAYASHI,YAHIKO

14. On Canonical Partition of Edge Set (Applied Combinatorial Theory and Algorithms)-----------------------------------------------190

　　　　Faculty of Science and Engineering, Chuo University / Kyo-yo-bu, Niigata University / Faculty of Engineering, Tokyo Institute of Technology　　　SHINODA,SHOJI / ISHIDA,CHIYOKO / KAWAMOTO,TATSUYA