Sciweavers

6740 search results - page 200 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
JGT
2010
109views more  JGT 2010»
13 years 5 months ago
Homomorphism-homogeneous graphs
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...
Momchil Rusinov, Pascal Schweitzer
ICPR
2002
IEEE
14 years 11 months ago
A New Algorithm for Inexact Graph Matching
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
Adel Hlaoui, Shengrui Wang
FAW
2007
Springer
115views Algorithms» more  FAW 2007»
14 years 4 months ago
An O ( nm )-Time Certifying Algorithm for Recognizing HHD-Free Graphs
In this paper, we consider the recognition problem on a class of perfectly orderable graphs, namely, the HHD-free graphs, i.e., graphs that do not contain any induced subgraph iso...
Stavros D. Nikolopoulos, Leonidas Palios
CORR
2011
Springer
205views Education» more  CORR 2011»
13 years 5 months ago
Random Walk on Directed Dynamic Graphs
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...
Oksana Denysyuk, Luis Rodrigues
SIAMCO
2008
81views more  SIAMCO 2008»
13 years 10 months ago
Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
This paper presents new graph-theoretic results appropriate to the analysis of a variety of consensus problems cast in dynamically changing environments. The concepts of rooted, s...
Ming Cao, A. Stephen Morse, Brian D. O. Anderson