Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
DAM
2002
82views more  DAM 2002»
10 years 29 days ago
On the computational complexity of strong edge coloring
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
Mohammad Mahdian
DAM
2002
135views more  DAM 2002»
10 years 1 months ago
Matchings in colored bipartite networks
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
Tongnyoul Yi, Katta G. Murty, Cosimo Spera
DAM
2002
61views more  DAM 2002»
10 years 1 months ago
Short trees in polygons
Pawel Winter, Martin Zachariasen, Jens Nielsen
DAM
2002
86views more  DAM 2002»
10 years 1 months ago
On enumerating all minimal solutions of feedback problems
Benno Schwikowski, Ewald Speckenmeyer
DAM
2002
68views more  DAM 2002»
10 years 1 months ago
Greedy algorithms for tracking mobile users in special mobility graphs
Stephan Olariu, Maria Cristina Pinotti, Larry Wils...
DAM
2002
75views more  DAM 2002»
10 years 1 months ago
On the robustness of primitive words
We investigate the e ect on primitive words of point mutations (inserting or deleting symbols, substituting a symbol for another one), of morphisms, and of the operation of taking...
Gheorghe Paun, Nicolae Santean, Gabriel Thierrin, ...
DAM
2002
75views more  DAM 2002»
10 years 1 months ago
Cutting planes in integer and mixed integer programming
Hugues Marchand, Alexander Martin, Robert Weismant...
DAM
2002
96views more  DAM 2002»
10 years 1 months ago
The structure of stable marriage with indifference
We consider the stable marriage problem where participants are permitted to express indifference in their preference lists (i.e., each list can be partially ordered). We prove tha...
David Manlove
DAM
2002
67views more  DAM 2002»
10 years 1 months ago
Optimal arrangement of data in a tree directory
We define the decision problem data arrangement, which involves arranging the vertices of a graph G at the leaves of a d-ary tree so that a weighted sum of the distances between p...
Malwina J. Luczak, Steven D. Noble
books