199 search results - page 21 / 40 » Connectivity of addable graph classes |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Orbits of graphs under local complementation (LC) and edge local complementation (ELC) have been studied in several different contexts. For instance, there are connections between...
ESA
1999
Springer
13 years 12 months ago
1999
Springer
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
WG
2010
Springer
13 years 6 months ago
2010
Springer
In this paper we investigate the basic problem of Exploration of a graph by a group of identical mobile computational entities, called robots, operating autonomously and asynchrono...
RSFDGRC
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, a new variant of Bagging named DepenBag is proposed. This algorithm obtains bootstrap samples at first. Then, it employs a causal discoverer to induce from each sam...
SPAA
2003
ACM
14 years 26 days ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...