Output-polynomial enumeration on graphs of bounded (local) linear MIM-width (Q1709594): Difference between revisions

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width
@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 6528538
@@ Property / title @@
+Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.05033
@@ Property / zbMATH Open document ID: 1382.05033 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-662-48971-0_22
@@ Property / DOI: 10.1007/978-3-662-48971-0_22 / rank @@
+Normal rank
@@ Property / published in @@
+Algorithms and Computation
@@ Property / published in: Algorithms and Computation / rank @@
+Normal rank
@@ Property / publication date @@
+January 2016Timestamp +2016-01-11T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2016-01-11T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 11 January 2016 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C31
@@ Property / Mathematics Subject Classification ID: 05C31 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6528538
@@ Property / zbMATH DE Number: 6528538 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+linear maximum induced matching width of a graph
+Normal rank
@@ Property / zbMATH Keywords @@
+LMIM-width
@@ Property / zbMATH Keywords: LMIM-width / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1922215400
@@ Property / OpenAlex ID: W1922215400 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2807230499
@@ Property / OpenAlex ID: W2807230499 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.03753
@@ Property / arXiv ID: 1509.03753 / rank @@
+Normal rank
@@ Property / cites work @@
+Reverse search for enumeration
@@ Property / cites work: Reverse search for enumeration / rank @@
+Normal rank
@@ Property / cites work @@
+Bidimensional Parameters and Local Treewidth
@@ Property / cites work: Bidimensional Parameters and Local Treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+The Bidimensional Theory of Bounded-Genus Graphs
@@ Property / cites work: The Bidimensional Theory of Bounded-Genus Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph classes with structured neighborhoods and algorithmic applications
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+On the Enumeration of Minimal Dominating Sets and Related Notions
+Normal rank
@@ Property / cites work @@
+Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
+Normal rank
@@ Property / cites work @@
+On the cubicity of interval graphs
@@ Property / cites work: On the cubicity of interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear delay enumeration and monadic second-order logic
+Normal rank
@@ Property / cites work @@
+Identifying the Minimal Transversals of a Hypergraph and Related Problems
+Normal rank
@@ Property / cites work @@
+Q4708957
@@ Property / cites work: Q4708957 / rank @@
+Normal rank
@@ Property / cites work @@
+New Results on Monotone Dualization and Generating Hypergraph Transversals
+Normal rank
@@ Property / cites work @@
+An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
+Normal rank
@@ Property / cites work @@
+Enumerating minimal dominating sets in chordal bipartite graphs
+Normal rank
@@ Property / cites work @@
+On generating all maximal independent sets
@@ Property / cites work: On generating all maximal independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets
+Normal rank
@@ Property / cites work @@
+On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs
+Normal rank
@@ Property / cites work @@
+A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs
+Normal rank
@@ Property / cites work @@
+Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs
+Normal rank
@@ Property / cites work @@
+Generating all vertices of a polyhedron is hard
@@ Property / cites work: Generating all vertices of a polyhedron is hard / rank @@
+Normal rank
@@ Property / cites work @@
+On enumerating minimal dicuts and strongly connected subgraphs
+Normal rank
@@ Property / cites work @@
+Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
+Normal rank
@@ Property / cites work @@
+Enumeration of the Elementary Circuits of a Directed Graph
+Normal rank
@@ Property / cites work @@
+Algorithms for Vertex Partitioning Problems on Partial k-Trees
+Normal rank

Latest revision as of 09:44, 15 July 2024

scientific article; zbMATH DE number 6528538

Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width

Language	Label	Description	Also known as
English	Output-polynomial enumeration on graphs of bounded (local) linear MIM-width	scientific article; zbMATH DE number 6528538	Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width