This paper discusses a method for recognizing certain graph classes based on elimination schemes more e ciently. We reduce the time bound for recognizing quasi-triangulated graphs from O(n 3 ) to O(n 2:77 ), and perfect elimination bipartite and cop-win graphs from O(n 3 ) to O(n 3 =log n).
β¦ LIBER β¦
Quasi-worlds and quasi-operators on quasi-triangulations
β Scribed by Deok-Soo Kim; Youngsong Cho; Kokichi Sugihara
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 1010 KB
- Volume
- 42
- Category
- Article
- ISSN
- 0010-4485
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Recognizing quasi-triangulated graphs
β
Jeremy P Spinrad
π
Article
π
2004
π
Elsevier Science
π
English
β 206 KB
On p-quasi-hyponormal operators
β
B.P. Duggal; In Ho Jeon
π
Article
π
2007
π
Elsevier Science
π
English
β 167 KB
Quasi-similarp-hyponormal operators
β
B. P. Duggal
π
Article
π
1996
π
SP BirkhΓ€user Verlag Basel
π
English
β 352 KB
Quasi-Greedy Triangulations Approximatin
β
Christos Levcopoulos; Drago Krznaric
π
Article
π
1998
π
Elsevier Science
π
English
β 334 KB
On Quasi-Jacobi and Jacobi-Quasi Bialgeb
β
J. M. Nunes da Costa; F. Petalidou
π
Article
π
2007
π
Springer
π
English
β 163 KB
Quasi-Orthogonality and Quasi-Projection
β
Michael Unser
π
Article
π
1996
π
Elsevier Science
π
English
β 275 KB
Our main concern in this paper is the design of simplified filtering procedures for the quasi-optimal approximation of functions in subspaces of L 2 generated from the translates of a function Ο(x). Examples of signal representations that fall into this framework are Schoenberg's polynomial splines