Sciweavers

1736 search results - page 94 / 348
» On antimagic directed graphs
Sort
View
AMC
2008
78views more  AMC 2008»
13 years 11 months ago
Information processing in complex networks: Graph entropy and information functionals
This paper introduces a general framework for defining the entropy of a graph. Our definition is based on a local information graph and on information functionals derived from the...
Matthias Dehmer
UAI
2008
14 years 6 days ago
Learning Inclusion-Optimal Chordal Graphs
Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algo...
Vincent Auvray, Louis Wehenkel
WSR
2008
14 years 6 days ago
Graph Technology in Reverse Engineering: The TGraph Approach
: TGraphs are directed graphs with typed, attributed, and ordered nodes and edges. These properties leverage the use of graphs as models for all kinds of artifacts in the context o...
Jürgen Ebert, Volker Riediger, Andreas Winter
DAC
2004
ACM
14 years 4 months ago
Hierarchical approach to exact symbolic analysis of large analog circuits
—This paper proposes a novel approach to the exact symbolic analysis of very large analog circuits. The new method is based on determinant decision diagrams (DDDs) representing s...
Sheldon X.-D. Tan, Weikun Guo, Zhenyu Qi
GECCO
2003
Springer
182views Optimization» more  GECCO 2003»
14 years 4 months ago
Modeling the Search Landscape of Metaheuristic Software Clustering Algorithms
Abstract. Software clustering techniques are useful for extracting architectural information about a system directly from its source code structure. This paper starts by examining ...
Brian S. Mitchell, Spiros Mancoridis