5473 search results - page 147 / 1095 » On the graph isomorphism problem |
191
Voted
CAAN
2006
Springer
15 years 10 months ago
2006
Springer
We consider scheduling problems that are motivated by an optimization of the transmission schedule of a smart antenna. In these problems we are given a set of messages and a confl...
250
click to vote
WG
2004
Springer
16 years 10 days ago
2004
Springer
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...
215
Voted
ESA
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We prove that for every graph H, there exists a polynomial-time algorithm deciding if a planar graph can be contracted to H. We introduce contractions and topological min...
214
Voted
JGT
2010
15 years 1 months ago
2010
We answer two open questions posed by Cameron and Nesetril concerning homomorphismhomogeneous graphs. In particular we show, by giving a characterization of these graphs, that ext...
220
click to vote
CORR
2011
Springer
15 years 2 months ago
2011
Springer
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the re...