Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Graph-Theoretic Concepts in Computer Science - MaRDI portal

Graph-Theoretic Concepts in Computer Science

From MaRDI portal

Publication:5897544

Jump to:navigation, search

DOI10.1007/11604686zbMath1126.05302MaRDI QIDQ5897544

Marc Noy, Omer Giménez, Petr Hliněný

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

Tutte polynomial cographs clique-width subexponential algorithm U polynomial

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

A Most General Edge Elimination Polynomial ⋮ Leaves for packings with block size four ⋮ Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width ⋮ Bipartite graphs as polynomials and polynomials as bipartite graphs ⋮ An extension of the bivariate chromatic polynomial

This page was built for publication: Graph-Theoretic Concepts in Computer Science

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5897544&oldid=16700841"