𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Recognizing triangulated Cartesian graph products

✍ Scribed by Shehzad Afzal; Clemens Brand


Book ID
113567405
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
209 KB
Volume
312
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Recognizing Cartesian graph bundles
✍ Wilfried Imrich; TomaαΊ‘ Pisanski; Janez Ẑerovnik πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 574 KB
On recognizing Cartesian graph bundles
✍ BlaΕΎ Zmazek; Janez Ε½erovnik πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 119 KB
Recognizing quasi-triangulated graphs
✍ Jeremy P Spinrad πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 206 KB

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).