2612 search results - page 213 / 523 » Switching Graphs and Their Complexity |
126
Voted
ICPR
2002
IEEE
16 years 5 months ago
2002
IEEE
In this paper, a new graph data structure for 2-D shape representation is proposed. The new structure is called a concavity graph, and is an evolution from the already known "...
118
Voted
WEA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using...
154
click to vote
MODELS
2009
Springer
15 years 11 months ago
2009
Springer
Model-based development of highly complex software systems leads to large models. Storing them in repositories offers the possibility to work with these models in a distributed env...
133
click to vote
ICDM
2008
IEEE
15 years 11 months ago
2008
IEEE
This paper studies how to incorporate side information (such as users’ feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studie...
127
Voted
ACSC
2007
IEEE
15 years 11 months ago
2007
IEEE
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...