Filters








24,977 Hits in 5.8 sec

On Feedback Vertex Set: New Measure and New Structures

Yixin Cao, Jianer Chen, Yang Liu
2014 Algorithmica  
We present a new parameterized algorithm for the feedback vertex set problem ( fvs) on undirected graphs.  ...  We then propose a new branch-and-search process on disjoint-fvs, and introduce a new branch-and-search measure.  ...  a graph G when a feedback vertex set of G is given.  ... 
doi:10.1007/s00453-014-9904-6 fatcat:z5qosvdqxbb2td7pf7nmsygmz4

SD approaches for feedback dynamic complexity analysis

Renan Jia, Cuixia Wang, Xiaojing Jia
2012 2012 International Symposium on Management of Technology (ISMOT)  
Many questions and further study on each of the four functions were respectively proposed. The paper is also a SD research summary of the group for nearly three decades.  ...  ; simulation; feedback loops calculation and management policy analysis.  ...  Science and Technology research project of Jiangxi Provincial Office of Education (GJJ09292)  ... 
doi:10.1109/ismot.2012.6679559 fatcat:v6ydvm3b7rdfppuwvgpbsmfrh4

Guest Editorial: Special Issue on Parameterized and Exact Computation, Part I

Venkatesh Raman, Saket Saurabh
2011 Algorithmica  
The size of the vertex cover (which measures how far the graph is from an edgeless graph) and the feedback vertex set (which measures how far the graph is from a forest) are such parameters especially  ...  Besides giving rise to new and interesting algorithm design techniques and complexity paradigms, the area has been highly successful in domains (like computational biology and artificial intelligence)  ...  The size of the vertex cover (which measures how far the graph is from an edgeless graph) and the feedback vertex set (which measures how far the graph is from a forest) are such parameters especially  ... 
doi:10.1007/s00453-011-9605-3 fatcat:5bwu4ykmlrcypdm5wzdvtehirq

New Races in Parameterized Algorithmics [chapter]

Christian Komusiewicz, Rolf Niedermeier
2012 Lecture Notes in Computer Science  
Herein, the attention usually focuses on improving the running time factor exponential in the considered parameter, and, in case of kernelization algorithms, to improve the bound on the kernel size.  ...  We discuss several of these aspects and particularly focus on the search for "stronger parameterizations" in developing fixed-parameter algorithms.  ...  We thank André Nichterlein, Manuel Sorge, and Mathias Weller for their comments which have improved this article.  ... 
doi:10.1007/978-3-642-32589-2_2 fatcat:gpfsek5febh5rikaagecihqclq

Observations on the shortest independent loop set algorithm

Jinjing Huang, Enda Howley, Jim Duggan
2012 System Dynamics Review  
System dynamics focuses on how feedback structures drive system behaviour.  ...  An established feedback loop analysis method is eigenvalue elasticity analysis (EEA), which analyzes a complete set of independent feedback loops in a given system.  ...  Every time a new feedback loop is introduced into ILS, the adjacency matrix, the distance matrix, and the visited vertex and edge set are updated.  ... 
doi:10.1002/sdr.1477 fatcat:oavy2w5ysjci3fonbbvspifuha

The disturbance rejection by measurement feedback problem revisited

Christian Commault, Jean-Michel Dion, Trong Hieu Do
2010 Proceedings of the 2010 American Control Conference  
In this paper, we revisit the disturbance rejection by measurement feedback (DRMF) problem in a structural framework.  ...  We prove that the study of this problem can be restricted to a subset of the state space and that the DRMF problem reduces to an unknown input observer problem on this subset.  ...  Disturbance Rejection by Measurement Feedback for structured systems In order to solve the DRMF problem in the context of structured systems we will define two important sets of vertices in the graph G  ... 
doi:10.1109/acc.2010.5530799 fatcat:beivcx53wfbbbggjk7tkjybrfy

Using star clusters for filtering

Javed Aslam, Katya Pelekhov, Daniela Rus
2000 Proceedings of the ninth international conference on Information and knowledge management - CIKM '00  
We use the on-line version of the star algorithm [JPR98, JPR99] as the clustering tool because this algorithm computes, with high precision, naturally occuring topics in a collection and it admits an efficient  ...  on-line solution for dynamic corpora.  ...  Acknowledgements This work is supported in part by ONR contract N00014-95-1-1204, Rome Labs contract F30602-98-C-0006, DARPA contract F30602-98-2-0107, NSF award BCS-9978116 and Air Force MURI contract  ... 
doi:10.1145/354756.354833 dblp:conf/cikm/AslamPR00 fatcat:4bv33wnsevfrpbjh7z42vz6kl4

Dynamic domination in fuzzy causal networks

Jian Ying Zhang, Zhi-Qiang Liu, Sanming Zhou
2006 IEEE transactions on fuzzy systems  
First, we propose a new inference procedure based on dominating sets. Second, we introduce the concepts of dynamic and minimal dynamic dominating sets (DDS and MDDS) in an FCN.  ...  Third, we investigate dynamic dominating sets with extended feedback, which we call effective dynamic dominating sets (EDDS), and related effective dynamic dominating process (EDDP).  ...  This is the feedback received by one particular vertex.  ... 
doi:10.1109/tfuzz.2005.861606 fatcat:fvba33avvvbthcwfjtjoejzaem

Bridging the Gap between Expert-Novice Differences

Dirk Ifenthaler
2010 Journal of Research on Technology in Education  
Results indicate that concept maps were structurally and semantically more similar to an expert solution than written texts.  ...  The study adds to the body of knowledge about different types of feedback. Feedback is considered a fundamental component for supporting and regulating learning processes.  ...  His research interests include technology and learning, mental models, problem solving, and longitudinal analysis methodologies.  ... 
doi:10.1080/15391523.2010.10782564 fatcat:vjgiu3x54napnfwucw7we6gqqu

Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity

Michael R. Fellows, Bart M.P. Jansen, Frances Rosamond
2013 European journal of combinatorics (Print)  
An extensive overview of recent advances on this front is presented for the Vertex Cover problem.  ...  The aim of this article is to motivate and describe the parameter ecology program, which studies how different parameters contribute to the difficulty of classical problems.  ...  Is there a structural parameter smaller than feedback vertex number with respect to which Feedback Vertex Set admits a polynomial kernel?  ... 
doi:10.1016/j.ejc.2012.04.008 fatcat:uzjyjuxec5hvlcep3jsf3mcupu

An improved FPT algorithm for Independent Feedback Vertex Set [article]

Shaohua Li, Marcin Pilipczuk
2020 arXiv   pre-print
We study the Independent Feedback Vertex Set problem - a variant of the classic Feedback Vertex Set problem where, given a graph G and an integer k, the problem is to decide whether there exists a vertex  ...  On the technical side, the main novelty is a refined measure of an input instance in a branching process, that allows for a simpler and more concise description and analysis of the algorithm.  ...  The Feedback Vertex Set problem (FVS) asks to find a feedback vertex set of the minimum size.  ... 
arXiv:1803.00937v2 fatcat:mjvzcvoxonhc3khbdhxnz6zk4y

Faster deterministic Feedback Vertex Set

Tomasz Kociumaka, Marcin Pilipczuk
2014 Information Processing Letters  
We present a new deterministic algorithm for the Feedback Vertex Set problem parameterized by the solution size.  ...  analysis and only a single branching rule.  ...  Acknowledgements This work has been partially supported by NCN grant UMO-2012/05/D/ST6/03214 and Foundation for Polish Science.  ... 
doi:10.1016/j.ipl.2014.05.001 fatcat:xbq5lsxhgza7jfjoxglyfjz77q

Transmittance matrices and flowgraph reduction

Kathleen D. Cebulka, Marialuisa N. McAllister
1985 Mathematical Modelling  
The structure of the reduction procedure is presented in Section 4.  ...  The subject of this paper is the computer representation and reduction of a particular graph known as a flowgraph. Basic terminology is developed in Section 1.  ...  At every feedback vertex there is at least one branch originating and one branch terminating. In fact, the same can be said of every vertex in the original flowgraph except for sources and sinks.  ... 
doi:10.1016/0270-0255(85)90060-0 fatcat:crj6dzomn5e57kiff2wsxbtdai

An Improved FPT Algorithm for Independent Feedback Vertex Set

Shaohua Li, Marcin Pilipczuk
2020 Theory of Computing Systems  
We study the INDEPENDENT FEEDBACK VERTEX SET problem -a variant of the classic FEEDBACK VERTEX SET problem where, given a graph G and an integer k, the problem is to decide whether there exists a vertex  ...  On the technical side, the main novelty is a refined measure of an input instance in a branching process, that allows for a simpler and more concise description and analysis of the algorithm.  ...  any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made.  ... 
doi:10.1007/s00224-020-09973-w fatcat:jc3glcgjbfd6jmcdombbe3apea

Exact Algorithms via Multivariate Subroutines [article]

Serge Gaspers, Edward Lee
2017 arXiv   pre-print
Our analyses are based on Measure and Conquer, but the value to minimize, 1+b-1/c, is unconventional and requires non-convex optimization.  ...  As case studies, we use these results to design faster deterministic algorithms for: - checking whether a graph has a feedback vertex set of size at most k - enumerating all minimal feedback vertex sets  ...  Fomin, and Saket Saurabh for discussions inspiring some of this work.  ... 
arXiv:1704.07982v1 fatcat:zfiwxq73tvcyzm4upyirgbyew4
« Previous Showing results 1 — 15 out of 24,977 results