239 search results - page 4 / 48 » Hardness and algorithms for rainbow connection |
FSTTCS
2008
Springer
14 years 10 months ago
2008
Springer
We consider the isomorphism and canonization problem for 3-connected planar graphs. The problem was known to be L -hard and in UL ∩ coUL [TW08]. In this paper, we give a determin...
ICESS
2005
Springer
15 years 3 months ago
2005
Springer
: This paper presents a simple and efficient switched Ethernet communication protocol for industrial hard real-time LAN applications. The network is founded with end nodes and a sw...
FOCS
2002
IEEE
15 years 2 months ago
2002
IEEE
We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant c. The best known algorithm [20] colors such a graph using O(n1/5 ) colors. Our...
STOC
2006
ACM
15 years 9 months ago
2006
ACM
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
DAC
2007
ACM
15 years 10 months ago
2007
ACM
The complexity and physical distribution of modern active-safety automotive applications requires the use of distributed architectures. These architectures consist of multiple ele...