DAM 2006 - PDF Preprint Papers

DAM 2006

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed DAM-2006 Paper

click to vote

DAM
2006

191views more DAM 2006»

Approximating the minimum clique cover and other hard problems in subtree filament graphs

13 years 5 months ago

Download webdocs.cs.ualberta.ca

Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...

J. Mark Keil, Lorna Stewart

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	191	Approximating the minimum clique cover and other hard problems in subtree filament graphs	claim
2	172	A Branch-and-Cut algorithm for graph coloring	claim
3	136	The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization,	claim
4	132	On the combinatorial structure of chromatic scheduling polytopes	claim
5	124	Coloring copoints of a planar point set	claim
6	121	Fine-grained forward-secure signature schemes without random oracles	claim
7	120	A bijection between permutations and floorplans, and its applications	claim
8	118	Maximizing breaks and bounding solutions to the mirrored traveling tournament problem	claim
9	116	Using graphs for some discrete tomography problems	claim
10	113	On the complexity of suboptimal decoding for list and decision feedback schemes	claim
11	106	Computational complexity of isothermic DNA sequencing by hybridization	claim
12	102	A general two-sided matching market with discrete concave utility functions	claim
13	102	Secret sharing schemes on access structures with intersection number equal to one	claim
14	100	On the colored Tutte polynomial of a graph of bounded treewidth	claim
15	100	A combinatorial algorithm for weighted stable sets in bipartite graphs	claim
16	97	Entity authentication schemes using braid word reduction	claim
17	97	Fully dynamic recognition algorithm and certificate for directed cographs	claim
18	93	Update schedules of sequential dynamical systems	claim
19	91	Precoloring extension on unit interval graphs	claim
20	89	First vs. best improvement: An empirical study	claim
21	88	A characterization of triangle-free tolerance graphs	claim
22	88	Finding nonnormal bent functions	claim
23	88	Domination analysis for minimum multiprocessor scheduling	claim
24	88	NP-completeness results for edge modification problems	claim
25	87	A new trust region technique for the maximum weight clique problem	claim
26	86	Sub-dominant theory in numerical taxonomy	claim
27	83	Scheduling workover rigs for onshore oil production	claim
28	81	The satisfactory partition problem	claim
29	81	Equivalence-free exhaustive generation of matroid representations	claim
30	79	A simple expected running time analysis for randomized "divide and conquer" algorithms	claim
31	79	Edge ranking of weighted trees	claim
32	78	Hybrid rounding techniques for knapsack problems	claim
33	78	A competitive and cooperative approach to propositional satisfiability	claim
34	76	Minimum cost and list homomorphisms to semicomplete digraphs	claim
35	75	A greedy approximation algorithm for the group Steiner problem	claim
36	73	Optimal on-line flow time with resource augmentation	claim
37	73	Construction of sports schedules with multiple venues	claim
38	71	Algorithms for clique-independent sets on subclasses of circular-arc graphs	claim
39	69	An algorithm to analyze stability of gene-expression patterns	claim
40	69	On the binary projective codes with dimension 6	claim
41	68	A strongly polynomial algorithm for solving two-sided linear systems in max-algebra	claim
42	68	List signature schemes	claim
43	66	Positivity of second order linear recurrent sequences	claim
44	66	On the structure of the adjacency matrix of the line digraph of a regular digraph	claim
45	64	On non-rank facets of stable set polytopes of webs with clique number four	claim
46	63	A novel use of t-packings to construct d-disjunct matrices	claim
47	63	A new family of proximity graphs: Class cover catch digraphs	claim
48	63	Efficient automatic simulation of parallel computation on networks of workstations	claim
49	62	Equivalence of some LP-based lower bounds for the Golomb ruler problem	claim
50	61	On error-tolerant DNA screening	claim
51	59	Optimal strategies for equal-sum dice games	claim
52	58	The elimination procedure for the competition number is not optimal	claim
53	57	The Hamiltonian problem on distance-hereditary graphs	claim
54	56	Reoptimization gaps versus model errors in online-dispatching of service units for ADAC	claim
55	56	On the least size of a graph with a given degree set	claim
56	49	Two-tuple balance of non-binary sequences with ideal two-level autocorrelation	claim
57	47	Trees of extremal connectivity index	claim
58	47	On the pagenumber of trivalent Cayley graphs	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers