Pseudoforest

Known as: Near-tree, Maximal pseudoforest, Unicyclic 
In graph theory, a pseudoforest is an undirected graph in which every connected component has at most one cycle. That is, it is a system of vertices… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1974-2017
0204019742017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
A pseudoforest is a graph where each connected component contains at most one cycle, or alternatively, a graph that can be turned… (More)
Is this relevant?
2015
2015
Feedback Vertex Set (FVS) is one of the most well studied problems in the realm of parameterized complexity. In this problem we… (More)
Is this relevant?
2010
2010
For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the… (More)
  • figure 3.1
  • figure 5.1
  • figure 5.2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We present in this paper a new, complete method for distributed constraint optimization, based on dynamic programming. It is a… (More)
Is this relevant?
2005
2005
In this paper, we determine upper and lower bounds for the number of independent sets in a unicyclic graph in terms of its order… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
The authors propose a topological analysis of large urban street networks based on a computational and functional graph… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 3
Is this relevant?
2001
2001
 
Is this relevant?
Highly Cited
2000
Highly Cited
2000
For an ordered subset W = {w1; w2; : : : ; wk} of vertices in a connected graph G and a vertex v of G, the metric representation… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 6
  • figure 8
Is this relevant?
1997
1997
Graph algorithms expressed in functional languages often suffer from their inherited imperative, state-based style. In particular… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?