251 search results - page 45 / 51 » The Graphs with All Subgraphs T-Perfect |
GC
2007
Springer
14 years 9 months ago
2007
Springer
We localize and strengthen Katona’s idea of an edge-toughness to a local topological toughness. We disprove a conjecture of Katona concerning the connection between edgetoughnes...
COLT
2003
Springer
15 years 2 months ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
ADC
2005
Springer
15 years 3 months ago
2005
Springer
We propose a path-based scheme for storage and retrieval of RDF data using a relational database. The Semantic Web is much anticipated as the nextgeneration web where high-level p...
MST
2006
14 years 9 months ago
2006
The board game FragmindTM poses the following problem: The player has to reconstruct an (unknown) string s over the alphabet . To this end, the game reports the following informati...
GD
2006
Springer
15 years 1 months ago
2006
Springer
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...