Parameterized complexity of connected even/odd subgraph problems (Q395000): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2154257407
@@ Property / OpenAlex ID: W2154257407 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q60488404
@@ Property / Wikidata QID: Q60488404 / rank @@
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+Counting Subgraphs via Homomorphisms
@@ Property / cites work: Counting Subgraphs via Homomorphisms / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of even/odd subgraph problems
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity of Eulerian Deletion Problems
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Eulerian graphs and related topics. Part 1, Volume 1
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:395000