Very Fast Construction of Bounded-Degree Spanning Graphs via the Semi-Random Graph Process

doi 10.1137/1.9781611975994.44
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Sparse Universal Graphs for Bounded-Degree Graphs

Random Structures and Algorithms
MathematicsApplied MathematicsComputer GraphicsComputer-Aided DesignSoftware
2007English

Almost-Spanning Universality in Random Graphs

Random Structures and Algorithms
MathematicsApplied MathematicsComputer GraphicsComputer-Aided DesignSoftware
2016English

Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios

2020English

Testing Expansion in Bounded-Degree Graphs

2007English

Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs

SIAM Journal on Computing
MathematicsComputer Science
2009English

Approximating Bounded-Degree Spanning Trees and Connected Factors With Leaves

Operations Research Letters
IndustrialApplied MathematicsManufacturing EngineeringManagement ScienceOperations ResearchSoftware
2017English

Fast Random Walk Graph Kernel

2012English

On the Number of Connected Sets in Bounded Degree Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Coloring Random and Semi-Random K-Colorable Graphs

Journal of Algorithms
1995English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy