93 search results - page 10 / 19 » The k-in-a-tree problem for graphs of girth at least k |
SODA
2001
ACM
13 years 8 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
CIAC
2010
Springer
14 years 4 months ago
2010
Springer
In this paper we consider a natural generalization of the well-known Max Leaf
Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as
input an undirected co...
FOCS
2002
IEEE
14 years 9 days ago
2002
IEEE
We show that Graph Isomorphism is in the complexity class SPP, and hence it is in ⊕P (in fact, it is in ModkP for each k ≥ 2). We derive this result as a corollary of a more g...
JCT
2007
13 years 7 months ago
2007
The codegree density γ(F) of an r-graph F is the largest number γ such that there are F-free r-graphs G on n vertices such that every set of r−1 vertices is contained in at le...
COMBINATORICS
2002
13 years 7 months ago
2002
The directed anti-Oberwolfach problem asks for a 2-factorization (each factor has in-degree 1 and out-degree 1 for a total degree of two) of K2n+1, not with consistent cycle compo...