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)

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Hans L. Bodlaender, Hirotaka Ono, Yota Otachi
- Discrete Applied Mathematics
- 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

- Geevarghese Philip, Ashutosh Rai, Saket Saurabh
- MFCS
- 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

- TomÃ¡s Feder, Pavol Hell, Peter Jonsson, Andrei A. Krokhin, Gustav Nordh
- SIAM J. Discrete Math.
- 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)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Adrian Petcu, Boi Faltings
- IJCAI
- 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

- Anders Sune Pedersen, Preben D. Vestergaard
- Discrete Applied Mathematics
- 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)

Is this relevant?

2001

Highly Cited

2000

Highly Cited

2000

- Gary Chartrand, Linda Eroh, Mark A. Johnson, Ortrud R. Oellermann
- Discrete Applied Mathematics
- 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)

Is this relevant?

1997

1997

- Martin Erwig
- ICFP
- 1997

Graph algorithms expressed in functional languages often suffer from their inherited imperative, state-based style. In particularâ€¦Â (More)

Is this relevant?

Highly Cited

1987

Highly Cited

1987

Â

Is this relevant?