Complete Axiomatization of an Algebraic Construction of Graphs

13 years 9 months ago

Download www.jaist.ac.jp

This paper presents a complete (inﬁnite) axiomatization for an algebraic construction of graphs, in which a ﬁnite fragment denotes the class of graphs with bounded tree width.

Mizuhito Ogawa

Real-time Traffic

Algebraic Construction | FLOPS 2004 | Hardware | Tree Width | ﬁnite Fragment |

claim paper

» A Constructive Proof of the Fundamental Theorem of Algebra without Using the Rationals

» A proof of completeness for continuous firstorder logic

» Nonlocal Flow of Control and Kleene Algebra with Tests

» Computational Complexity of Some Problems Involving Congruences on Algebras

» Towards Decentralization of Multirobot Navigation Functions

» The recognizability of sets of graphs is a robust property

» The meaning of Negative Premises in Transition System Specifications

» Dormant Independence

Post Info
More Details (n/a)

Added	01 Jul 2010
Updated	01 Jul 2010
Type	Conference
Year	2004
Where	FLOPS
Authors	Mizuhito Ogawa

Comments (0)

Sciweavers

Complete Axiomatization of an Algebraic Construction of Graphs

Algebraic Construction | FLOPS 2004 | Hardware | Tree Width | ﬁnite Fragment |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers