IPL 2006 - PDF Preprint Papers

IPL 2006

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed IPL-2006 Paper

click to vote

IPL
2006

153views more IPL 2006»

Oriented vertex and arc colorings of outerplanar graphs

13 years 5 months ago

Download hal.archives-ouvertes.fr

A homomorphism from an oriented graph G to an oriented graph H is an arc-preserving mapping from V (G) to V (H), that is (x)(y) is an arc in H whenever xy is an arc in G. The orie...

Alexandre Pinlou, Eric Sopena

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	153	Oriented vertex and arc colorings of outerplanar graphs	claim
2	151	Approximating weighted matchings in parallel	claim
3	141	Perfectly Reliable Message Transmission	claim
4	139	An adjustable linear time parallel algorithm for maximum weight bipartite matching	claim
5	120	Propositional dynamic logic of context-free programs and fixpoint logic with chop	claim
6	118	Easy intruder deduction problems with homomorphisms	claim
7	117	P systems without multiplicities of symbol-objects	claim
8	116	Guarding galleries and terrains	claim
9	115	Approximate maximum weight branchings	claim
10	114	Quantum lower bounds for the Goldreich-Levin problem	claim
11	111	A new algorithm for online uniform-machine scheduling to minimize the makespan	claim
12	110	Variationally universal hashing	claim
13	109	The number of guillotine partitions in d dimensions	claim
14	109	Knuth-Bendix completion of theories of commuting group endomorphisms	claim
15	108	Robustness of k-gon Voronoi diagram construction	claim
16	105	A new approximation algorithm for labeling points with circle pairs	claim
17	105	Finding and counting cliques and independent sets in r-uniform hypergraphs	claim
18	104	Optimal register allocation for SSA-form programs in polynomial time	claim
19	104	The communication complexity of the Hamming distance problem	claim
20	103	On the cost of searching signature trees	claim
21	101	An efficient approximation for the Generalized Assignment Problem	claim
22	100	Strong normalization proofs by CPS-translations	claim
23	99	Computational complexity of queries based on itemsets	claim
24	98	Transforming spanning trees and pseudo-triangulations	claim
25	97	A fixed-parameter tractability result for multicommodity demand flow in trees	claim
26	97	A tight lower bound for job scheduling with cancellation	claim
27	96	A closer look at constraints as processes	claim
28	95	Smaller superconcentrators of density 28	claim
29	93	A decidable characterization of the classes between lintime and exptime	claim
30	93	Applying adaptive test cases to nondeterministic implementations	claim
31	92	A constructive approach to sequential Nash equilibria	claim
32	91	Improved undecidability results on weighted timed automata	claim
33	89	Optimal 2-constraint satisfaction via sum-product algorithms	claim
34	89	Adaptive general perfectly periodic scheduling	claim
35	88	A note on the attractor-property of infinite-state Markov chains	claim
36	88	On Quickselect, partial sorting and Multiple Quickselect	claim
37	88	Improved construction for universality of determinant and permanent	claim
38	87	Vertex rankings of chordal graphs and weighted trees	claim
39	87	Strongly secure ramp secret sharing schemes for general access structures	claim
40	87	Fast generators for the Diffie-Hellman key agreement protocol and malicious standards	claim
41	87	Implementing unreliable failure detectors with unknown membership	claim
42	86	Monotone circuits for monotone weighted threshold functions	claim
43	86	On the relationship between squared pairings and plain pairings	claim
44	86	Mu-calculus path checking	claim
45	86	A linear space algorithm for computing a longest common increasing subsequence	claim
46	85	A flaw in the electronic commerce protocol SET	claim
47	84	On the hardness of approximating Max-Satisfy	claim
48	84	Test suite oscillations	claim
49	83	The Pair Completion algorithm for the Homogeneous Set Sandwich Problem	claim
50	81	Overcoming observability problems in distributed test architectures	claim
51	80	BubbleSearch: A simple heuristic for improving priority-based greedy algorithms	claim
52	79	Bandwidth allocation algorithms for weighted maximum rate constrained link sharing policy	claim
53	77	Flow equivalent trees in undirected node-edge-capacitated planar graphs	claim
54	76	Fraction interpolation walking a Farey tree	claim
55	75	On obtaining the Boyer-Moore string-matching algorithm by partial evaluation	claim
56	74	Periodic and Sturmian languages	claim
57	72	Structure and linear time recognition of 3-leaf powers	claim
58	72	Cayley graphs as models of deterministic small-world networks	claim
59	72	Acyclic colorings of products of trees	claim
60	71	Analysis of improved signcryption scheme with key privacy	claim
61	71	Determining the specificity of terms using inside-outside information: a necessary condition of term hierarchy mining	claim
62	70	A polynomial time approximation scheme for embedding a directed hypergraph on a ring	claim
63	69	Efficient polynomial time algorithms computing industrial-strength primitive roots	claim
64	69	On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P	claim
65	67	A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs	claim
66	65	Known-plaintext cryptanalysis of the Domingo-Ferrer algebraic privacy homomorphism scheme	claim
67	61	Fair service for mice in the presence of elephants	claim
68	56	A general compression algorithm that supports fast searching	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers