Search results
From MaRDI portal
- rectangulations and geometric matrix multiplication 2018-02-28 Paper Induced subgraph isomorphism: are some patterns substantially easier than others? 2015-10-30...10 bytes (16 words) - 11:13, 6 October 2023
- 2013-08-16 Paper Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others? 2012-09-25 Paper Unique Small Subgraphs Are Not Easier...10 bytes (16 words) - 01:14, 13 December 2023
- Publication Date of Publication Type Logical complexity of induced subgraph isomorphism for certain families of graphs 2021-07-21 Paper...10 bytes (18 words) - 12:32, 14 March 2024
- Publication Date of Publication Type Logical complexity of induced subgraph isomorphism for certain families of graphs 2021-07-21 Paper...10 bytes (18 words) - 12:32, 14 March 2024
- https://portal.mardi4nfdi.de/entity/Q5365132 2017-09-29 Paper Induced subgraph isomorphism: are some patterns substantially easier than others? 2015-10-30...10 bytes (18 words) - 11:11, 6 October 2023
- complexity of induced subgraph isomorphism for certain families of graphs 2021-07-21 Paper First-order definitions of subgraph isomorphism through the adjacency...10 bytes (17 words) - 02:05, 25 September 2023
- hard problems on deterministic finite automata 2015-02-20 Paper Induced subgraph isomorphism on proper interval and bipartite permutation graphs 2014-12-02...10 bytes (16 words) - 01:26, 11 December 2023
- Paper On the complexity of various parameterizations of common induced subgraph isomorphism 2017-09-28 Paper On the Parameterized Parallel Complexity and...10 bytes (20 words) - 09:01, 7 October 2023
- Paper Clique-width of full bubble model graphs 2015-04-28 Paper Induced subgraph isomorphism on proper interval and bipartite permutation graphs 2014-12-02...10 bytes (16 words) - 03:18, 7 October 2023
- Paper On the complexity of various parameterizations of common induced subgraph isomorphism 2017-09-28 Paper The graph motif problem parameterized by the...10 bytes (16 words) - 08:06, 7 October 2023
- Paper Finding Disjoint Paths in Split Graphs 2015-01-13 Paper Induced subgraph isomorphism on proper interval and bipartite permutation graphs 2014-12-02...10 bytes (20 words) - 18:16, 11 December 2023
- Asymptotic Descriptive Complexity of Subgraph Isomorphism 2019-07-04 Paper The descriptive complexity of subgraph isomorphism without numerics 2019-07-04 Paper...10 bytes (17 words) - 01:44, 10 December 2023
- Paper On the complexity of various parameterizations of common induced subgraph isomorphism 2017-09-28 Paper The graph motif problem parameterized by the...10 bytes (16 words) - 09:41, 6 October 2023
- Paper Finding Disjoint Paths in Split Graphs 2015-01-13 Paper Induced subgraph isomorphism on proper interval and bipartite permutation graphs 2014-12-02...10 bytes (17 words) - 01:27, 10 December 2023
- Paper Extreme Witnesses and Their Applications 2016-02-05 Paper Induced subgraph isomorphism: are some patterns substantially easier than others? 2015-10-30...10 bytes (16 words) - 02:54, 9 December 2023
- Resolution 2009-07-07 Paper Understanding the Complexity of Induced Subgraph Isomorphisms 2008-08-28 Paper Kernelizations for Parameterized Counting Problems...10 bytes (16 words) - 15:32, 6 October 2023
- Recoloring of Trees 2009-03-06 Paper Understanding the Complexity of Induced Subgraph Isomorphisms 2008-08-28 Paper https://portal.mardi4nfdi.de/entity/Q5451198...10 bytes (16 words) - 11:28, 24 September 2023
- 2009-03-02 Paper Understanding the Complexity of Induced Subgraph Isomorphisms 2008-08-28 Paper An Isomorphism Between Subexponential and Parameterized Complexity...10 bytes (16 words) - 03:30, 7 October 2023
- 2013-01-07 Paper Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs 2012-11-06 Paper Isomorphism of (mis)Labeled Graphs...10 bytes (17 words) - 11:54, 11 December 2023
- embeddable subtrees 2017-12-04 Paper Characterizing the complexity of subgraph isomorphism for graphs of bounded path-width 2017-11-16 Paper Shortest Reconfiguration...10 bytes (16 words) - 12:43, 11 December 2023
