Search results
From MaRDI portal
- Comparative Multi-Dataset Study 2023-07-21 Paper A generalized multiscale independent cover method for nonlocal damage simulation 2023-05-22 Paper Coupled the...10 bytes (16 words) - 23:35, 11 December 2023
- long-term density propagation 2024-04-18 Paper A generalized multiscale independent cover method for nonlocal damage simulation 2023-05-22 Paper Incremental...10 bytes (16 words) - 20:09, 24 September 2023
- multiscale independent cover method for nonlocal damage simulation 2023-05-22 Paper Improve the ill-conditioning for small physical covers by area normalized...10 bytes (16 words) - 19:22, 24 September 2023
- max independent set, min vertex cover and related problems by moderately exponential algorithms 2012-04-30 Paper Fast algorithms for max independent set...10 bytes (16 words) - 12:40, 28 January 2024
- max independent set, min vertex cover and related problems by moderately exponential algorithms 2012-04-30 Paper Fast algorithms for max independent set...10 bytes (19 words) - 10:53, 9 December 2023
- ε)-Approximation for Vertex Cover in O(log Δ / ε log log Δ) Rounds 2018-05-17 Paper Distributed Approximation of Maximum Independent Set and Maximum Matching...10 bytes (18 words) - 07:47, 9 December 2023
- measures based on the number of independent sets and matchings 2021-03-31 Paper An improved algorithm for the vertex cover $P_3$ problem on graphs of bounded...10 bytes (17 words) - 18:49, 11 December 2023
- max independent set, min vertex cover and related problems by moderately exponential algorithms 2012-04-30 Paper Fast algorithms for max independent set...10 bytes (16 words) - 12:40, 28 January 2024
- de/entity/Q5111290 2020-05-26 Paper Independent domination versus weighted independent domination 2020-02-11 Paper Temporal vertex cover with a sliding time window...10 bytes (17 words) - 20:00, 11 December 2023
- Connected Vertex Cover problem 2020-02-25 Paper Maximum independent sets in subcubic graphs: new results 2020-02-24 Paper Weighted Upper Edge Cover: Complexity...10 bytes (16 words) - 21:08, 9 December 2023
- of the once-punctured torus 2018-09-04 Paper Cover contact graphs 2017-03-09 Paper Quantum state-independent contextuality requires 13 rays 2016-10-18 Paper...10 bytes (18 words) - 07:09, 12 December 2023
- The connected vertex cover problem in \(k\)-regular graphs 2019-06-25 Paper Complexity and algorithms for the connected vertex cover problem in 4-regular...10 bytes (17 words) - 21:25, 9 December 2023
- Revisited 2015-12-30 Paper Unit disk cover problem in 2D 2015-08-18 Paper Approximation algorithms for maximum independent set of a unit disk graph 2014-12-15...10 bytes (18 words) - 19:55, 8 December 2023
- Paper Independent trees and branchings in planar multigraphs 2000-06-13 Paper Independent branchings in acyclic digraphs 1999-08-09 Paper Independent trees...10 bytes (16 words) - 16:33, 8 December 2023
- twin-leaves with smallest number of maximal independent sets 2020-02-17 Paper Independent domination versus weighted independent domination 2020-02-11 Paper On algorithms...10 bytes (18 words) - 21:25, 9 December 2023
- \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs 2019-06-21 Paper Characterizing mutagenic...10 bytes (19 words) - 15:23, 6 December 2023
- domination number of a graph 2022-06-13 Paper Graphs with a unique maximum independent set up to automorphisms 2022-05-27 Paper On graphs with equal total domination...10 bytes (17 words) - 17:15, 11 December 2023
- analysis of an online algorithm for the vertex cover problem 2010-08-16 Paper A better list heuristic for vertex cover 2010-04-19 Paper Hardness results and approximation...10 bytes (16 words) - 20:51, 8 December 2023
- Roman subdivision number of graphs 2022-03-17 Paper The stability of independent transversal domination in trees 2021-04-16 Paper An algorithm to recognize...10 bytes (20 words) - 09:27, 9 December 2023
- Anti-Ramsey numbers for graphs with independent cycles 2010-03-26 Paper The second largest number of maximal independent sets in graphs with at most \(k\)...10 bytes (17 words) - 20:16, 11 December 2023
