- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
1 Online-Ressource.
- Language
-
Englisch
- Bibliographic citation
-
Near-optimal distributed dominating set in bounded arboricity graphs ; volume:37 ; number:4 ; day:15 ; month:5 ; year:2023 ; pages:387-398 ; date:12.2024
Distributed computing ; 37, Heft 4 (15.5.2023), 387-398, 12.2024
- Creator
-
Dory, Michal
Ghaffari, Mohsen
Ilchi, Saeed
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00446-023-00447-z
- URN
-
urn:nbn:de:101:1-2501252116015.679477835632
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:21 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Dory, Michal
- Ghaffari, Mohsen
- Ilchi, Saeed
- SpringerLink (Online service)
Other Objects (12)
Efficient distributed bounded property checking
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width
Recognizing Map Graphs of Bounded Treewidth
Embedding spanning bounded degree graphs in randomly perturbed graphs
Decomposition of Graphs Into Graphs with Bounded Maximum Degrees
On sets bounded truth-table reducible to P-selective sets
Approximation of Ellipsoids Using Bounded Uncertainty Sets
Graph Partitioning for Distributed Graph Processing
Deleting Vertices to Graphs of Bounded Genus
Ultrafilter Extensions of Bounded Graphs are Elementary
Approximating distributed graph algorithms
Planar point sets with bounded ratios of distances
Efficient distributed bounded property checking
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width
Recognizing Map Graphs of Bounded Treewidth
Embedding spanning bounded degree graphs in randomly perturbed graphs
Decomposition of Graphs Into Graphs with Bounded Maximum Degrees
On sets bounded truth-table reducible to P-selective sets
Approximation of Ellipsoids Using Bounded Uncertainty Sets
Graph Partitioning for Distributed Graph Processing
Deleting Vertices to Graphs of Bounded Genus
Ultrafilter Extensions of Bounded Graphs are Elementary
Approximating distributed graph algorithms
Planar point sets with bounded ratios of distances
Efficient distributed bounded property checking
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width
Recognizing Map Graphs of Bounded Treewidth
Embedding spanning bounded degree graphs in randomly perturbed graphs
Decomposition of Graphs Into Graphs with Bounded Maximum Degrees
On sets bounded truth-table reducible to P-selective sets
Approximation of Ellipsoids Using Bounded Uncertainty Sets
Graph Partitioning for Distributed Graph Processing
Deleting Vertices to Graphs of Bounded Genus
Ultrafilter Extensions of Bounded Graphs are Elementary
Approximating distributed graph algorithms