Primitivity is hereditary for 2-structures
Theoretical Computer Science
Computing a maximum cardinality matching in a bipartite graph in time On1.5m/logn
Information Processing Letters
Faster scaling algorithms for general graph matching problems
Journal of the ACM (JACM)
Stability number of bull- and chair-free graphs
Discrete Applied Mathematics
Polynomially solvable cases for the maximum stable set problem
Discrete Applied Mathematics - Special volume: Aridam VI and VII, Rutcor, New Brunswick, NJ, USA (1991 and 1992)
Modular decomposition and transitive orientation
Discrete Mathematics - Special issue on partial ordered sets
Data structures for weighted matching and nearest common ancestors with linking
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Convex Quadratic Programming Approach to the Maximum Matching Problem
Journal of Global Optimization
A New Approach to Maximum Matching in General Graphs
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Structure and stability number of chair-, co-P- and gem-free graphs revisited
Information Processing Letters
Stability number of bull- and chair-free graphs revisited
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Polynomial algorithm for finding the largest independent sets in graphs without forks
Discrete Applied Mathematics
Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes
Information Processing Letters
Maximum Matchings via Gaussian Elimination
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Independent sets in extensions of 2K2-free graphs
Discrete Applied Mathematics
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
On clique separators, nearly chordal graphs, and the maximum weight stable set problem
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Independent Sets of Maximum Weight in Apple-Free Graphs
SIAM Journal on Discrete Mathematics
Hybrid tractability of valued constraint problems
Artificial Intelligence
Maximum weight independent sets in hole- and dart-free graphs
Discrete Applied Mathematics
Maximum regular induced subgraphs in 2P3-free graphs
Theoretical Computer Science
Maximum weight independent sets in (P6,co-banner)-free graphs
Information Processing Letters
On atomic structure of P5-free subclasses and Maximum Weight Independent Set problem
Theoretical Computer Science
Distance-$$d$$ independent set problems for bipartite and chordal graphs
Journal of Combinatorial Optimization
A note on efficient domination in a superclass of P5-free graphs
Information Processing Letters
| Hi-index | 0.00 |
The class of fork-free graphs is an extension of claw-free graphs and their subclass of line graphs. The first polynomial-time solution to the maximum weight independent set problem in the class of line graphs, which is equivalent to the maximum matching problem in general graphs, has been proposed by Edmonds in 1965 and then extended to the entire class of claw-free graphs by Minty in 1980. Recently, Alekseev proposed a solution for the larger class of fork-free graphs, but only for the unweighted version of the problem, i.e., finding an independent set of maximum cardinality. In the present paper, we describe the first polynomial-time algorithm to solve the problem for weighted fork-free graphs.