DAM 2008 - PDF Preprint Papers

DAM 2008

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed DAM-2008 Paper

click to vote

DAM
2008

147views more DAM 2008»

Efficient edge domination in regular graphs

14 years 15 days ago

Download www.isa.utl.pt

13 An induced matching of a graph G is a matching having no two edges joined by14 an edge. An efficient edge dominating set of G is an induced matching M such that15 every other ed...

Domingos Moreira Cardoso, J. Orestes Cerdeira, Cha...

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	147	Efficient edge domination in regular graphs	claim
2	145	Unicyclic and bicyclic graphs having minimum degree distance	claim
3	145	Graph coloring in the estimation of sparse derivative matrices: Instances and applications	claim
4	140	The minimum spanning strong subdigraph problem is fixed parameter tractable	claim
5	139	Covering symmetric semi-monotone functions	claim
6	136	General theory of information transfer: Updated	claim
7	135	Edge ranking and searching in partial orders	claim
8	134	Efficient algorithms for finding critical subgraphs	claim
9	131	Partition into cliques for cubic graphs: Planar case, complexity and approximation	claim
10	129	Minimum cost homomorphisms to semicomplete multipartite digraphs	claim
11	125	Heyting algebras with Boolean operators for rough sets and information retrieval applications	claim
12	123	Ultrametrics, Banach's fixed point theorem and the Riordan group	claim
13	123	Polar cographs	claim
14	117	Analysis on the strip-based projection model for discrete tomography	claim
15	116	Expected number of breakpoints after t random reversals in genomes with duplicate genes	claim
16	115	Variable space search for graph coloring	claim
17	114	Efficient solutions to the braid isotopy problem	claim
18	112	On the correlation of binary sequences	claim
19	111	Games played by Boole and Galois	claim
20	111	Sums of squares based approximation algorithms for MAX-SAT	claim
21	110	Counting and enumerating aggregate classifiers	claim
22	109	Minimal comparability completions of arbitrary graphs	claim
23	108	Feedback vertex set on AT-free graphs	claim
24	108	On the complexity of the multicut problem in bounded tree-width graphs and digraphs	claim
25	103	Crown reductions for the Minimum Weighted Vertex Cover problem	claim
26	103	Counting preimages of TCP reordering patterns	claim
27	102	On the computational complexity of partial covers of Theta graphs	claim
28	102	Formulas for approximating pseudo-Boolean random variables	claim
29	101	Longest alternating subsequences of k-ary words	claim
30	101	Three Hoppy path problems and ternary paths	claim
31	101	Degree constrained subgraphs	claim
32	99	Boundary value problems on weighted networks	claim
33	93	Planar graph bipartization in linear time	claim
34	92	Convex drawings of graphs with non-convex boundary constraints	claim
35	92	Applications to cryptography of twisting commutative algebraic groups	claim
36	91	Media theory: Representations and examples	claim
37	91	The Newton Bracketing method for the minimization of convex functions subject to affine constraints	claim
38	90	The stable marriage problem with master preference lists	claim
39	90	Polarity of chordal graphs	claim
40	89	T-shift synchronization codes	claim
41	88	On the asymmetric representatives formulation for the vertex coloring problem	claim
42	88	Stochastic applications of media theory: Random walks on weak orders or partial orders	claim
43	87	Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs	claim
44	85	On the complexity of constrained VC-classes	claim
45	85	Fractionally total colouring Gn, p	claim
46	85	The competition numbers of complete tripartite graphs	claim
47	84	Edge-splittings preserving local edge-connectivity of graphs	claim
48	84	The colourful feasibility problem	claim
49	83	Multi-group support vector machines with measurement costs: A biobjective approach	claim
50	83	Spanning forests and the golden ratio	claim
51	83	Models and quantifier elimination for quantified Horn formulas	claim
52	82	On multicolour noncomplete Ramsey graphs of star graphs	claim
53	82	Closest 4-leaf power is fixed-parameter tractable	claim
54	82	A distance-labelling problem for hypercubes	claim
55	81	Random-order bin packing	claim
56	80	Weighted fusion graphs: Merging properties and watersheds
57	78	On classes of minimal circular-imperfect graphs	claim
58	78	Semi-preemptive routing on trees	claim
59	76	Binary clustering	claim
60	75	Equistable distance-hereditary graphs	claim
61	75	Patterns of simple gene assembly in ciliates	claim
62	74	A distributional study of the path edge-covering numbers for random trees	claim
63	73	Searching with lies under error cost constraints	claim
64	72	On the existence of maximal elements: An impossibility theorem	claim
65	72	Minimization of circuit registers: Retiming revisited	claim
66	72	Diameter-sufficient conditions for a graph to be super-restricted connected	claim
67	71	On hereditary clique-Helly self-clique graphs	claim
68	70	Pairings for cryptographers	claim
69	69	Algorithms for media	claim
70	69	Impact of memory size on graph exploration capability	claim
71	68	Multiple packing in sum-type metric spaces	claim
72	68	The convexity spectra of graphs	claim
73	68	Parameterized algorithmics for linear arrangement problems	claim
74	67	On the variance of Shannon products of graphs	claim
75	67	Extended resolution simulates binary decision diagrams	claim
76	67	Remembering Leo Khachiyan	claim
77	67	Rotation symmetric Boolean functions - Count and cryptographic properties	claim
78	64	Biprobabilistic values for bicooperative games	claim
79	64	On diagnosability of large multiprocessor networks	claim
80	63	Skew partitions in perfect graphs	claim
81	62	The edge-diametric theorem in Hamming spaces	claim
82	62	Geodeticity of the contour of chordal graphs	claim
83	61	Scheduling malleable tasks with interdependent processing rates: Comments and observations	claim
84	61	Facet defining inequalities among graph invariants: The system GraPHedron	claim
85	59	Vertex coloring acyclic digraphs and their corresponding hypergraphs	claim
86	56	Mutual exclusion scheduling with interval graphs or related classes. Part II	claim
87	51	Ratewise-optimal non-sequential search strategies under constraints on the tests	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers