Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • algorithm for the maximum covering cycle problem 2020-01-20 Paper Mixed-integer programming approaches for the tree \(t^*\)-spanner problem 2019-10-18...
    10 bytes (18 words) - 22:06, 10 December 2023
  • matrix-tree theorem, with applications to complete colorful and cubical complexes 2018-07-18 Paper Möbius coinvariants and bipartite edge-rooted forests...
    10 bytes (16 words) - 20:06, 11 December 2023
  • de/entity/Q2725320 2001-01-01 Paper Spanning trees with constraints on the leaf degree 2001-01-01 Paper Straight line embeddings of rooted star forests in the plane...
    10 bytes (16 words) - 15:05, 9 December 2023
  • 2014-09-24 Paper Principal minors Pfaffian half-tree theorem 2014-03-14 Paper From cycle rooted spanning forests to the critical Ising model: an explicit...
    10 bytes (18 words) - 22:32, 10 December 2023
  • the depth restricted (1,2)-minimum spanning tree problem 2020-02-11 Paper Fixed-parameter tractability for minimum tree cut/paste distance and minimum common...
    10 bytes (17 words) - 10:22, 11 December 2023
  • minimum stretch spanning tree problem for typical graphs 2021-08-17 Paper Optimality computation of the minimum stretch spanning tree problem 2021-03-16...
    10 bytes (16 words) - 16:48, 8 December 2023
  • Publication Date of Publication Type Distance approximating spanning trees 2022-11-09 Paper https://portal.mardi4nfdi.de/entity/Q3099758 2011-12-01 Paper...
    10 bytes (16 words) - 16:14, 8 December 2023
  • Paper Rainbow and properly colored spanning trees in edge-colored bipartite graphs 2021-11-25 Paper Spanning trees with small diameters 2021-10-05 Paper...
    10 bytes (16 words) - 11:59, 9 December 2023
  • of minimum cost spanning tree games: P-hardness and polynomial cases 2012-12-28 Paper REDUCTION OF ULTRAMETRIC MINIMUM COST SPANNING TREE GAMES TO COST ALLOCATION...
    10 bytes (17 words) - 10:27, 6 October 2023
  • sparsification for parametric minimum spanning tree problems 2022-12-09 Paper Finding the k smallest spanning trees 2022-12-09 Paper Geometric dominating...
    10 bytes (17 words) - 15:15, 10 December 2023
  • matchings of a tree 2007-04-10 Paper On an identity for the cycle indices of rooted tree automorphism groups 2007-03-12 Paper A class of trees and its Wiener...
    10 bytes (19 words) - 19:36, 9 December 2023
  • The number of tournaments with a unique spanning cycle 1982-01-01 Paper The outer-distance of nodes in random trees 1981-01-01 Paper https://portal.mardi4nfdi...
    10 bytes (19 words) - 11:00, 12 December 2023
  • Publication Type Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result 2023-10-09 Paper Spanning trees in graphs of...
    10 bytes (19 words) - 03:26, 9 December 2023
  • Paper The Minimum Weight In-Tree Cover Problem 2009-05-13 Paper Enumerating Constrained Non-crossing Geometric Spanning Trees 2009-03-06 Paper Fast enumeration...
    10 bytes (16 words) - 04:41, 9 December 2023
  • 2001-11-11 Paper On rooted node-connectivity problems 2001-10-14 Paper A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs 2001-01-07...
    10 bytes (16 words) - 05:56, 9 December 2023
  • Paper Root vertex valency distributions of rooted maps and rooted triangulations 1994-11-08 Paper Spanning Eulerian subgraphs of bounded degree in triangulations...
    10 bytes (17 words) - 17:52, 9 December 2023
  • 2003-06-23 Paper A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs 2003-03-17 Paper https://portal.mardi4nfdi...
    10 bytes (17 words) - 20:56, 9 December 2023
  • agreement forest of two rooted binary phylogenetic trees 2016-10-20 Paper Kernelization and parameterized algorithms for covering a tree by a set of stars or...
    10 bytes (16 words) - 06:02, 7 October 2023
  • Type FPT algorithms for packing \(k\)-safe spanning rooted sub(di)graphs 2024-02-14 Paper Complementary cycles of any length in regular bipartite tournaments...
    10 bytes (16 words) - 12:10, 11 December 2023
  • Paper Spanning galaxies in digraphs 2013-10-10 Paper Oriented trees in digraphs 2013-04-15 Paper A linear vertex kernel for maximum internal spanning tree...
    10 bytes (17 words) - 07:10, 9 December 2023
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)