Sciweavers

1097 search results - page 28 / 220
» Testing Graph Isomorphism
Sort
View
MPC
2004
Springer
115views Mathematics» more  MPC 2004»
15 years 3 months ago
A Free Construction of Kleene Algebras with Tests
In this paper we define Kleene algebra with tests in a slightly more general way than Kozen’s definition. Then we give an explicit construction of the free Kleene algebra with...
Hitoshi Furusawa
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
14 years 11 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
DM
2008
177views more  DM 2008»
14 years 9 months ago
The independence number in graphs of maximum degree three
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independent set of cardinality at least 1 7 (4n - m - - tr) where counts the number of c...
Jochen Harant, Michael A. Henning, Dieter Rautenba...
JCT
2011
83views more  JCT 2011»
14 years 4 months ago
Sandpile groups and spanning trees of directed line graphs
Abstract. We generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G and its directed line graph LG. The sandpile group is an abelian group associa...
Lionel Levine
ESA
2008
Springer
130views Algorithms» more  ESA 2008»
14 years 11 months ago
Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
Christian Bachmaier, Wolfgang Brunner