2612 search results - page 83 / 523 » Switching Graphs and Their Complexity |
138
click to vote
LICS
2005
IEEE
15 years 8 months ago
2005
IEEE
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
116
click to vote
CAS
2008
15 years 3 months ago
2008
In this paper we first present a novel approach to determine the structural information content (graph entropy) of a network represented by an undirected and connected graph. Such...
147
click to vote
IPPS
2010
IEEE
15 years 28 days ago
2010
IEEE
Complex networks capture interactions among entities in various application areas in a graph representation. Analyzing large scale complex networks often answers important question...
122
click to vote
EUROCOLT
1995
Springer
15 years 6 months ago
1995
Springer
Limiting identification of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identification of programs for computable functions (fr...
114
click to vote
DLT
2006
15 years 4 months ago
2006
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...