COMBINATORICS 2002

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed COMBINATORICS-2002 Paper

click to vote

COMBINATORICS
2002

136views more COMBINATORICS 2002»

Minimum Connected Dominating Sets of Random Cubic Graphs

13 years 11 months ago

Download www.combinatorics.org

We present a simple heuristic for finding a small connected dominating set of cubic graphs. The average-case performance of this heuristic, which is a randomised greedy algorithm,...

William Duckworth

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	136	Minimum Connected Dominating Sets of Random Cubic Graphs	claim
2	116	Toida's Conjecture is True	claim
3	113	Longest Increasing Subsequences in Pattern-Restricted Permutations	claim
4	111	A Density Result for Random Sparse Oriented Graphs and its Relation to a Conjecture of Woodall	claim
5	109	Efficient Packing of Unit Squares in a Square	claim
6	107	Combinatorial Laplacian of the Matching Complex	claim
7	105	Counting 1324-Avoiding Permutations	claim
8	104	Exchange Symmetries in Motzkin Path and Bargraph Models of Copolymer Adsorption	claim
9	102	Computation in Coxeter Groups-I. Multiplication	claim
10	99	Packing Patterns into Words	claim
11	99	A Generalization of Simion-Schmidt's Bijection for Restricted Permutations	claim
12	97	Words Restricted by Patterns with at Most 2 Distinct Letters	claim
13	93	On a Theorem of Erdos, Rubin, and Taylor on Choosability of Complete Bipartite Graphs	claim
14	92	On the Excluded Minors for Matroids of Branch-Width Three	claim
15	92	New Lower Bound Formulas for Multicolored Ramsey Numbers	claim
16	92	Pattern Avoidance in Permutations: Linear and Cyclic Orders	claim
17	90	Ternary Constant Weight Codes	claim
18	89	Generating a Random Sink-free Orientation in Quadratic Time	claim
19	89	A Concise Proof of the Littlewood-Richardson Rule	claim
20	88	Graph Color Extensions: When Hadwiger's Conjecture and Embeddings Help	claim
21	88	MacWilliams Identities and Matroid Polynomials	claim
22	87	Map Genus, Forbidden Maps, and Monadic Second-Order Logic	claim
23	87	Kasteleyn Cokernels	claim
24	86	On the Dimer Problem and the Ising Problem in Finite 3-dimensional Lattices	claim
25	86	Computation of the Vertex Folkman Numbers F(2, 2, 2, 4;6) and F(2, 3, 4;6)	claim
26	85	Parking Functions of Types A and B	claim
27	85	Sum List Coloring 2*n Arrays	claim
28	84	Compositions of Random Functions on a Finite Set	claim
29	83	Identifying Codes with Small Radius in Some Infinite Regular Graphs	claim
30	83	The Minimum Number of Monotone Subsequences	claim
31	83	Irreducible Coverings by Cliques and Sperner's Theorem	claim
32	82	A Survey of Stack-Sorting Disciplines	claim
33	82	Non-Repetitive Tilings	claim
34	82	The Directed Anti-Oberwolfach Solution: Pancyclic 2-Factorizations of Complete Directed Graphs of Odd Order	claim
35	81	A Generalisation of Transversals for Latin Squares	claim
36	80	321-Polygon-Avoiding Permutations and Chebyshev Polynomials	claim
37	79	A 'Nice' Bijection for a Content Formula for Skew Semistandard Young Tableaux	claim
38	77	Motzkin Paths and Reduced Decompositions for Permutations with Forbidden Patterns	claim
39	77	Profile Classes and Partial Well-Order for Permutations	claim
40	77	On the Number of Permutations Admitting an m-th Root	claim
41	76	On the Number of Distributive Lattices	claim
42	76	Catalan Traffic at the Beach	claim
43	75	Cycle Index, Weight Enumerator, and Tutte Polynomial	claim
44	74	Permutations Avoiding Two Patterns of Length Three	claim
45	73	Relaxed Graceful Labellings of Trees	claim
46	73	Prefix Exchanging and Pattern Avoidance by Involutions	claim
47	73	A Note on Odd Cycle-Complete Graph Ramsey Numbers	claim
48	72	Linearly Independent Products of Rectangularly Complementary Schur Functions	claim
49	71	The Number of Labeled 2-Connected Planar Graphs	claim
50	71	Permutations Which Avoid 1243 and 2143, Continued Fractions, and Chebyshev Polynomials	claim
51	71	A Specht Module Analog for the Rook Monoid	claim
52	70	Set-Systems with Restricted Multiple Intersections	claim
53	69	Homogeneous Permutations	claim
54	69	A Small Trivalent Graph of Girth 14	claim
55	69	Spanning Trees and Function Classes	claim
56	68	On the Orbits of Singer Groups and Their Subgroups	claim
57	68	Holes in Graphs	claim
58	68	On the Connectivity of Graphs Embedded in Surfaces II	claim
59	67	Sparse Graphs Usually Have Exponentially Many Optimal Colorings	claim
60	65	Sorting with a Forklift	claim
61	65	Thue-like Sequences and Rainbow Arithmetic Progressions	claim
62	64	The Packing Density of Other Layered Permutations	claim
63	63	Generalizing the Ramsey Problem through Diameter	claim
64	62	New Lower Bounds for Heilbronn Numbers	claim
65	62	On Recursively Directed Hypercubes	claim
66	60	Parking Functions, Stack-Sortable Permutations, and Spaces of Paths in the Johnson Graph	claim
67	59	On Packing Densities of Permutations	claim
68	59	On Counting Permutations by Pairs of Congruence Classes of Major Index	claim
69	58	Triangle Free Sets and Arithmetic Progressions - Two Pisier Type Problems	claim
70	56	A Proof of the Two-path Conjecture	claim
71	54	Bitableaux Bases for some Garsia-Haiman Modules and Other Related Modules	claim
72	52	A Prolific Construction of Strongly Regular Graphs with the n-e.c. Property	claim
73	51	On Growth Rates of Closed Permutation Classes	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers