9532 search results - page 78 / 1907 » Logic, Graphs, and Algorithms |
112
click to vote
COCOON
2005
Springer
15 years 4 months ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
IJNSEC
2008
14 years 11 months ago
2008
In group communication, users often have different access rights to multiple data streams. Based on the access relation of users and data streams, users can form partially ordered...
PVLDB
2008
14 years 10 months ago
2008
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query...
112
click to vote
COMBINATORICA
2010
14 years 6 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
111
click to vote
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...