Isomorphism Testing for Graphs of Bounded Rank Width

May 14, 2015 · The Ethereal · 🏛 IEEE Annual Symposium on Foundations of Computer Science

🔮 THE ETHEREAL: The Ethereal
Pure theory — exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Martin Grohe, Pascal Schweitzer arXiv ID 1505.03737 Category cs.DM: Discrete Mathematics Cross-listed cs.DS, math.CO Citations 47 Venue IEEE Annual Symposium on Foundations of Computer Science Last Checked 1 month ago
Abstract
We give an algorithm that, for every fixed k, decides isomorphism of graphs of rank width at most k in polynomial time. As the clique width of a graph is bounded in terms of its rank width, we also obtain a polynomial time isomorphism test for graph classes of bounded clique width.
Community shame:
Not yet rated
📄 View on arXiv 🌐 View on ar5iv 📑 PDF 🎉 Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Discrete Mathematics