Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • classes of graphs with ``few minimal separators: FPT results through potential maximal cliques 2019-03-11 Paper An \(O(n^2)\) time algorithm for the minimal permutation...
    10 bytes (17 words) - 11:54, 11 December 2023
  • graphs with ``few minimal separators: FPT results through potential maximal cliques 2019-03-11 Paper Exact algorithms for weak Roman domination 2018-09-17...
    10 bytes (17 words) - 11:54, 11 December 2023
  • results through potential maximal cliques 2019-03-11 Paper Two rounds are enough for reconstructing any graph (class) in the congested clique model 2019-01-30...
    10 bytes (16 words) - 11:04, 6 October 2023
  • https://portal.mardi4nfdi.de/entity/Q2766670 2002-07-22 Paper Listing all potential maximal cliques of a graph 2002-07-15 Paper Treewidth and Minimum Fill-in: Grouping...
    10 bytes (17 words) - 09:17, 12 December 2023
  • triangulations parameterized by edge clique cover 2022-08-03 Paper Solving Graph Problems via Potential Maximal Cliques 2019-03-27 Paper...
    10 bytes (16 words) - 01:04, 25 September 2023
  • incomplete MaxSAT 2019-10-14 Paper Solving Graph Problems via Potential Maximal Cliques 2019-03-27 Paper Subsumed Label Elimination for Maximum Satisfiability...
    10 bytes (16 words) - 06:19, 7 October 2023
  • extremal graphs 2021-05-10 Paper Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs 2021-02-16 Paper Analytic representations...
    10 bytes (16 words) - 20:24, 6 October 2023
  • cubic graphs 2021-11-30 Paper Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs 2021-02-16 Paper A version of the Loebl-Komlós-Sós...
    10 bytes (17 words) - 03:48, 25 September 2023
  • Frameworks from Examples 2019-11-26 Paper Solving Graph Problems via Potential Maximal Cliques 2019-03-27 Paper Cautious reasoning in ASP via minimal models and...
    10 bytes (17 words) - 14:05, 7 October 2023
  • Algorithms parameterized by vertex cover and modular width, through potential maximal cliques 2018-05-23 Paper Tight Lower Bounds on Graph Embedding Problems...
    10 bytes (19 words) - 23:54, 9 December 2023
  • of Thomassen's conjecture 2023-08-10 Paper Disjoint isomorphic balanced clique subdivisions 2023-05-02 Paper The number of maximum primitive sets of integers...
    10 bytes (17 words) - 12:29, 28 January 2024
  • at Least Five 2021-03-12 Paper Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs 2021-02-16 Paper Quasi-polynomial time approximation...
    10 bytes (18 words) - 09:05, 7 October 2023
  • at Least Five 2021-03-12 Paper Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs 2021-02-16 Paper Linear Kernels for Edge...
    10 bytes (17 words) - 02:52, 7 October 2023
  • https://portal.mardi4nfdi.de/entity/Q3415601 2007-01-19 Paper A finding maximal clique algorithm for predicting loop of protein structure 2006-10-31 Paper...
    10 bytes (16 words) - 07:06, 9 December 2023
  • Paper On the smallest maximal partial ovoids and spreads of the generalized quadrangles \(W(q)\) and \(Q(4,q)\) 2007-08-27 Paper Clique algorithms for classifying...
    10 bytes (16 words) - 19:02, 12 December 2023
  • mardi4nfdi.de/entity/Q4633895 2019-05-06 Paper Clique-width III 2019-03-28 Paper Enumeration of maximal irredundant sets for claw-free graphs 2018-12-04...
    10 bytes (19 words) - 23:54, 9 December 2023
  • vertices on Hamiltonian cycles 2012-02-08 Paper Characterizing degree-sum maximal nonhamiltonian bipartite graphs 2012-01-11 Paper https://portal.mardi4nfdi...
    10 bytes (19 words) - 20:13, 8 December 2023
  • Paper Stability of the Potential Function 2018-09-25 Paper On the strong chromatic index of sparse graphs 2018-08-15 Paper Extending precolorings to distinguish...
    10 bytes (17 words) - 20:42, 9 December 2023
  • Paper Dominating sets inducing large components in maximal outerplanar graphs 2018-07-13 Paper Maximal determinants of combinatorial matrices 2018-06-20...
    10 bytes (17 words) - 20:52, 8 December 2023
  • mardi4nfdi.de/entity/Q3403594 2010-02-12 Paper An order-clique-based approach for mining maximal co-locations 2009-10-01 Paper Moment estimates for weak...
    10 bytes (17 words) - 07:14, 12 December 2023
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)