Bounds on the bisection width for random \(d\)-regular graphs (Q2381523): Difference between revisions

@@ Property / author @@
-Josep Diaz
@@ Property / author: Josep Diaz / rank @@
-Normal rank
@@ Property / author @@
-Maria J. Serna
@@ Property / author: Maria J. Serna / rank @@
-Normal rank
@@ Property / author @@
+Josep Diaz
@@ Property / author: Josep Diaz / rank @@
+Normal rank
@@ Property / author @@
+Maria J. Serna
@@ Property / author: Maria J. Serna / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q106185036
@@ Property / Wikidata QID: Q106185036 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2007.03.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2122388370
@@ Property / OpenAlex ID: W2122388370 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Edge-Expansion of Graphs
@@ Property / cites work: On the Edge-Expansion of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q2766666
@@ Property / cites work: Q2766666 / rank @@
+Normal rank
@@ Property / cites work @@
+The isoperimetric number of random regular graphs
@@ Property / cites work: The isoperimetric number of random regular graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Paths in graphs
@@ Property / cites work: Paths in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on the max and min bisection of random cubic and random 4-regular graphs
+Normal rank
@@ Property / cites work @@
+A note on approximating Max-Bisection on regular graphs
+Normal rank
@@ Property / cites work @@
+Q3877805
@@ Property / cites work: Q3877805 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4828975
@@ Property / cites work: Q4828975 / rank @@
+Normal rank
@@ Property / cites work @@
+A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
+Normal rank
@@ Property / cites work @@
+Q2762518
@@ Property / cites work: Q2762518 / rank @@
+Normal rank
@@ Property / cites work @@
+The Metropolis algorithm for graph bisection
@@ Property / cites work: The Metropolis algorithm for graph bisection / rank @@
+Normal rank
@@ Property / cites work @@
+Q4027167
@@ Property / cites work: Q4027167 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximumk-colorable subgraphs
@@ Property / cites work: Maximumk-colorable subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4779170
@@ Property / cites work: Q4779170 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on bipartite subgraphs of triangle‐free graphs
+Normal rank
@@ Property / cites work @@
+Generating Random Regular Graphs Quickly
@@ Property / cites work: Generating Random Regular Graphs Quickly / rank @@
+Normal rank
@@ Property / cites work @@
+Differential equations for random processes and random graphs
+Normal rank
@@ Property / cites work @@
+Q4938890
@@ Property / cites work: Q4938890 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4263664
@@ Property / cites work: Q4263664 / rank @@
+Normal rank
@@ Property / cites work @@
+Analysis of greedy algorithms on graphs with bounded degrees
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2381523