Search results
From MaRDI portal
- and a branch-and-cut algorithm for the set orienteering problem 2024-04-16 Paper A genetic approach for the 2‐edge‐connected minimum branch vertices problem...10 bytes (17 words) - 11:06, 11 December 2023
- and a branch-and-cut algorithm for the set orienteering problem 2024-04-16 Paper A genetic approach for the 2‐edge‐connected minimum branch vertices problem...10 bytes (17 words) - 03:09, 9 December 2023
- have few branch vertices and leaves 2023-03-24 Paper Degree Conditions for Claw-Free Graphs to Have Spanning Trees with at Most Five Branch Vertices and Leaves...10 bytes (18 words) - 22:34, 24 September 2023
- Segments or Branching Vertices 2021-11-15 Paper On the Modified First Zagreb Connection Index of Trees of a Fixed Order and Number of Branching Vertices 2021-05-17...10 bytes (16 words) - 10:49, 25 September 2023
- Spanning trees with few peripheral branch vertices 2021-10-11 Paper Spanning trees whose reducible stems have a few branch vertices 2021-09-16 Paper...10 bytes (18 words) - 09:39, 25 September 2023
- Paper Degree conditions for graphs to have spanning trees with few branch vertices and leaves 2019-03-21 Paper https://portal.mardi4nfdi.de/entity/Q4568202...10 bytes (16 words) - 11:59, 9 December 2023
- and a branch-and-cut algorithm for the set orienteering problem 2024-04-16 Paper A genetic approach for the 2‐edge‐connected minimum branch vertices problem...10 bytes (16 words) - 16:48, 24 September 2023
- and signless Laplacian spectral radius of graphs with fixed number of branch vertices 2019-03-28 Paper Erdős-Gallai stability theorem for linear forests 2019-01-22...10 bytes (17 words) - 19:41, 13 December 2023
- Order and Number of Branching Vertices 2021-05-17 Paper A note on the minimum Wiener polarity index of trees with a given number of vertices and segments or...10 bytes (18 words) - 05:58, 25 September 2023
- edge-swap heuristic for generating spanning trees with minimum number of branch vertices 2014-04-30 Paper A Python/C library for bound-constrained global optimization...10 bytes (21 words) - 02:14, 12 December 2023
- of Publication Type Spanning trees whose reducible stems have a few branch vertices 2021-09-16 Paper...10 bytes (18 words) - 21:25, 26 December 2023
- $\mathbf{\textit{n}}$-Vertex Chemical Trees with Fixed Number of Segments or Branching Vertices 2021-11-15 Paper...10 bytes (18 words) - 21:48, 26 December 2023
- edge-swap heuristic for generating spanning trees with minimum number of branch vertices 2014-04-30 Paper A multi-population hybrid biased random key genetic...10 bytes (18 words) - 01:34, 11 December 2023
- edge-swap heuristic for generating spanning trees with minimum number of branch vertices 2014-04-30 Paper...10 bytes (20 words) - 11:17, 6 October 2023
- local dimension of posets 2020-04-09 Paper On spanning trees with few branch vertices 2019-12-12 Paper https://portal.mardi4nfdi.de/entity/Q5244007 2019-11-19...10 bytes (16 words) - 22:34, 24 September 2023
- hierarchy problem 2018-12-06 Paper A generalization of the minimum branch vertices spanning tree problem 2018-08-17 Paper Approximation of the Degree-Constrained...10 bytes (16 words) - 20:08, 24 September 2023
- hierarchy problem 2018-12-06 Paper A generalization of the minimum branch vertices spanning tree problem 2018-08-17 Paper Approximation of the Degree-Constrained...10 bytes (16 words) - 20:08, 24 September 2023
- rainbow spanning forest problem 2018-10-22 Paper A branch-and-cut algorithm for the minimum branch vertices spanning tree problem 2018-07-11 Paper On the complexity...10 bytes (17 words) - 18:38, 24 September 2023
- Order and Number of Branching Vertices 2021-05-17 Paper A note on the minimum Wiener polarity index of trees with a given number of vertices and segments or...10 bytes (16 words) - 12:10, 24 September 2023
- Spanning trees with few peripheral branch vertices 2021-10-11 Paper Spanning trees whose reducible stems have a few branch vertices 2021-09-16 Paper Modified defect...10 bytes (19 words) - 04:12, 7 October 2023
