1395 search results - page 149 / 279 » (k, )-Distance-Hereditary Graphs |
150
click to vote
ECCC
2010
15 years 2 months ago
2010
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
130
click to vote
ICML
2006
IEEE
16 years 4 months ago
2006
IEEE
I consider the setting of transductive learning of vertex labels in graphs, in which a graph with n vertices is sampled according to some unknown distribution; there is a true lab...
135
click to vote
ICTAI
2007
IEEE
15 years 10 months ago
2007
IEEE
The classification of graph based objects is an important challenge from a knowledge discovery standpoint and has attracted considerable attention recently. In this paper, we pres...
135
click to vote
COMBINATORICS
2006
15 years 4 months ago
2006
We give a parity reversing involution on noncrossing trees that leads to a combinatorial interpretation of a formula on noncrossing trees and symmetric ternary trees in answer to a...
141
click to vote
JGT
2008
15 years 4 months ago
2008
: This article proves the following result: Let G and G be graphs of orders n and n , respectively. Let G be obtained from G by adding to each vertex a set of n degree 1 neighbors....