Name
Title | ||
|---|---|---|
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. |
Abstract | ||
|---|---|---|
The first algorithm runs in time \(5.44^{\ell } (n+t)^{{\mathcal {O}}(1)}\) where t is the number of maximal independent sets of the input graph. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-45043-3_32 | WG |
Keywords | Field | DocType |
Maximum induced subgraphs,Perfect graphs,Co-chordal graphs,Randomized FPT algorithms,Polynomial kernel lower bounds | Discrete mathematics,Indifference graph,Combinatorics,Induced path,Chordal graph,Induced subgraph isomorphism problem,Induced subgraph,Cograph,Mathematics,Strong perfect graph theorem,Split graph | Conference |
Volume | Issue | ISSN |
81 | 1 | 1432-0541 |
Citations | PageRank | References |
4 | 0.43 | 15 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Neeldhara Misra | 1 | 341 | 31.42 |
| Fahad Panolan | 2 | 112 | 23.04 |
| Ashutosh Rai | 3 | 28 | 7.82 |
| Venkatesh Raman | 4 | 2268 | 153.49 |
| Saket Saurabh | 5 | 2023 | 179.50 |