Searching for authors named Anders Dessmark – sorted by Relevance.
-
On Parallel Complexity of Maximum F-Matching and the Degree Sequence Problem
- On parallel complexity of maximum f-matching and the degree sequence problem Anders Dessmark Oscar
- Add To MetaCart
-
Ultrafast Randomized Parallel Constructionand Approximation Algorithms for Spanning Forests in Dense Graphs
- in Dense Graphs Anders Dessmark 2 , Carsten Dorgerloh 1 , Andrzej Lingas 2 , and Jurgen Wirtgen 1 1
- Cited by 2 (1 self) – Add To MetaCart
-
The Maximum K-Dependent and F-Dependent Set Problem
- The maximum k-dependent and f-dependent set problem Anders Dessmark Klaus Jansen y Andrzej
- Cited by 1 (0 self) – Add To MetaCart
-
Faster Algorithms for Subgraph Isomorphism of k-connected Partial k-trees
- Faster Algorithms for Subgraph Isomorphism of k-connected Partial k-trees Anders Dessmark Lund
- Cited by 7 (1 self) – Add To MetaCart
-
Deterministic Rendezvous in Graphs
- Deterministic rendezvous in graphs Anders Dessmark x Pierre Fraigniaud yx Andrzej Pelc z
- Cited by 13 (1 self) – Add To MetaCart
-
On the Approximability of Maximum and Minimum Edge Clique Partition Problems
- On the Approximability of Maximum and Minimum Edge Clique Partition Problems Anders Dessmark
- Cited by 1 (0 self) – Add To MetaCart

