Modular decomposition

In graph theory, the modular decomposition is a decomposition of a graph into subsets of vertices called modules. A module is a generalization of a…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2010

In a finite undirected graph, an apple consists of a chordless cycle of length at least 4, and an additional vertex which is not…

2010

This paper introduces the design of the lab intelligent remote monitoring system based on S3C2440 ARM microprocessor. Aiming at…

2004

A homogeneous set is a non-trivial, proper subset of a graph’s vertices such that all its elements present exactly the same outer…

2004

1999

NLCk is a family of algebras on vertex-labeled graphs introduced by Wanke. An NLC-decomposition of a graph is a derivation of…

1994

In the past, different authors developed distinct approaches to the problem of transitive orientation. This also resulted in…

1990

A hierarchical modular structure is presented for real-time control and monitoring of flexible manufacturing systems (FMSs), in…

1989

1986

We show that the combination of dynamic programming with partial-order decomposition algorithms enables us to solve sequencing…

1982

Consider a flow network having random arc capacities and having associated with each node n a “supply-demand random variable” Yn…