Sciweavers

192 search results - page 14 / 39
» On Graph Isomorphism for Restricted Graph Classes
Sort
View
DAM
1998
85views more  DAM 1998»
14 years 11 months ago
Separability Generalizes Dirac's Theorem
In our study of the extremities of a graph, we define a moplex as a maximal clique module the neighborhood of which is a minimal separator of the graph. This notion enables us to...
Anne Berry, Jean Paul Bordat
CORR
2007
Springer
132views Education» more  CORR 2007»
14 years 11 months ago
Automatic Structures: Richness and Limitations
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a...
Bakhadyr Khoussainov, André Nies, Sasha Rub...
SODA
2008
ACM
84views Algorithms» more  SODA 2008»
15 years 1 months ago
Robust cost colorings
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
Takuro Fukunaga, Magnús M. Halldórss...
BMCBI
2011
14 years 6 months ago
Hierarchical graphs for rule-based modeling of biochemical systems
Background: In rule-based modeling, graphs are used to represent molecules: a colored vertex represents a component of a molecule, a vertex attribute represents the internal state...
Nathan W. Lemons, Bin Hu, William S. Hlavacek
COCOON
2009
Springer
15 years 6 months ago
Edge-Intersection Graphs of k-Bend Paths in Grids
Edge-intersection graphs of paths in grids are graphs that can be represented with vertices as paths in grids and edges between the vertices of the graph exist whenever two grid pa...
Therese C. Biedl, Michal Stern