Sciweavers

1883 search results - page 64 / 377
» Ordered theta graphs
Sort
View
ENTCS
2002
105views more  ENTCS 2002»
13 years 7 months ago
Fixed points in digital topology (via Helly posets)
Abstract. We extend some of our previous results on fixed points of graph multifunctions to posets. The posets of most interest here are the (finite) Khalimsky spaces, in their spe...
Rueiher Tsaur, Michael B. Smyth
ICDM
2007
IEEE
118views Data Mining» more  ICDM 2007»
14 years 2 months ago
Subgraph Support in a Single Large Graph
—Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. Ho...
Mathias Fiedler, Christian Borgelt
MLG
2007
Springer
14 years 1 months ago
Support Computation for Mining Frequent Subgraphs in a Single Graph
—Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. Ho...
Mathias Fiedler, Christian Borgelt
CONCUR
2004
Springer
14 years 1 months ago
Verifying Finite-State Graph Grammars: An Unfolding-Based Approach
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the ...
Paolo Baldan, Andrea Corradini, Barbara König
DSD
2003
IEEE
100views Hardware» more  DSD 2003»
14 years 1 months ago
Fast Heuristics for the Edge Coloring of Large Graphs
Heuristic algorithms for coloring the edges of large undirected single-edge graphs with (or very close to) the minimal number of colors are presented. Compared to simulated anneal...
Mario Hilgemeier, Nicole Drechsler, Rolf Drechsler