DSpace at KOASAS
Browsing DSpace

Browse "Dept. of Mathematical Sciences(수리과학과)" by Subject branch-width

A to Z

All 0-9

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

or enter first few letters:

Showing results 1 to 8 of 8

1
Approximating clique-width and branch-width

Oum, Sang-il; Seymour, P, JOURNAL OF COMBINATORIAL THEORY SERIES B, v.96, no.4, pp.514 - 528, 2006-07

2
Approximating Rank-Width and Clique-Width Quickly

Oum, Sang-il, ACM TRANSACTIONS ON ALGORITHMS , v.5, no.1, pp.1 - 20, 2008-11

3
Finding branch-decompositions and rank-decompositions

Hlineny, P; Oum, Sang-il, SIAM JOURNAL ON COMPUTING, v.38, no.3, pp.1012 - 1032, 2008

4
Rank-width and vertex-minors

Oum, Sang-il, JOURNAL OF COMBINATORIAL THEORY SERIES B, v.95, no.1, pp.79 - 100, 2005-09

5
Rank-width is less than or equal to branch-width

Oum, Sang-il, JOURNAL OF GRAPH THEORY, v.57, no.3, pp.239 - 244, 2008-03

6
Testing branch-width

Oum, Sang-il; Seymour, P, JOURNAL OF COMBINATORIAL THEORY SERIES B, v.97, no.3, pp.385 - 393, 2007-05

7
The "Art of Trellis Decoding" Is Fixed-Parameter Tractable

Jeong, Jisu; Kim, Eun Jung; Oum, Sang-il, IEEE TRANSACTIONS ON INFORMATION THEORY, v.63, no.11, pp.7178 - 7205, 2017-11

8
Width parameters beyond tree-width and their applications

Hlineny, P; Oum, Sang-il; Seese, D; Gottlob, G, COMPUTER JOURNAL, v.51, no.3, pp.326 - 362, 2008-05

Discover

rss_1.0 rss_2.0 atom_1.0