Xing Feng

Orcid: 0009-0007-7248-594X

According to our database1, Xing Feng authored at least 38 papers between 1985 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Enumeration of perfect matchings of the middle graph of a graph <i>G</i> with △(<i>G</i>)≤4.
Discret. Math., April, 2024

Concentration phenomenon about h-extra edge-connectivity of the n-th cartesian product of complete graph K<sub>4</sub> with large-scale faulty links.
J. Supercomput., January, 2024

Enumeration of spanning trees with a perfect matching of hexagonal lattices on the cylinder and Möbius strip.
Discret. Appl. Math., 2024

A concentration phenomenon for <i>h</i>-extra edge-connectivity reliability analysis of enhanced hypercubes Q_{n,2} with exponentially many faulty links.
CoRR, 2024

A real-time rendering method for high albedo anisotropic materials with multiple scattering.
CoRR, 2024

Exploration and Improvement of Nerf-based 3D Scene Editing Techniques.
CoRR, 2024

Methods and Strategies for Improving the Novel View Synthesis Quality of Neural Radiation Field.
IEEE Access, 2024

2023
Accelerating Graph Similarity Search via Efficient GED Computation.
IEEE Trans. Knowl. Data Eng., May, 2023

The influence of emotional experience on learning effect in blended learning in post-epidemic era.
Proceedings of the 6th International Conference on Big Data and Education, 2023

2022
Reliability measure of the <i>n</i>-th cartesian product of complete graph <i>K</i><sub>4</sub> on <i>h</i>-extra edge-connectivity.
Theor. Comput. Sci., 2022

2021
On extremal nonsolid bricks.
J. Graph Theory, 2021

The chromatic number of { ISK4ISK4 ISK 4 , diamond, bowtie}-free graphs.
J. Graph Theory, 2021

Laminar tight cuts in matching covered graphs.
J. Comb. Theory B, 2021

A conjecture on the lower bound of the signed edge domination number of 2-connected graphs.
Discret. Appl. Math., 2021

2020
A characterization of nonfeasible sets in matching covered graphs.
J. Graph Theory, 2020

The Chromatic Number of Graphs with No Induced Subdivision of K<sub>4</sub>.
Graphs Comb., 2020

Equivalence classes in matching covered graphs.
Discret. Math., 2020

b-Invariant Edges in Essentially 4-Edge-Connected Near-Bipartite Cubic Bricks.
Electron. J. Comb., 2020

Fluorescence Molecular Tomography Reconstruction of Small Targets Using Stacked Auto-Encoder Neural Networks.
IEEE Access, 2020

Speeding Up GED Verification for Graph Similarity Search.
Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

2019
Disjoint Odd Cycles in Cubic Solid Bricks.
SIAM J. Discret. Math., 2019

Efficient Parallel Computing of Graph Edit Distance.
Proceedings of the 35th IEEE International Conference on Data Engineering Workshops, 2019

2018
An O(log<sub>2</sub>(N)) Algorithm for Reliability Evaluation of h-Extra Edge-Connectivity of Folded Hypercubes.
IEEE Trans. Reliab., 2018

An O(|E(G)|<sup>2</sup>) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs.
J. Comb. Optim., 2018

Distributed computing connected components with linear communication cost.
Distributed Parallel Databases, 2018

Enumeration of perfect matchings of lattice graphs by Pfaffians.
Appl. Math. Comput., 2018

2017
Efficiently computing graph similarity and graph connectivity.
PhD thesis, 2017

A Sufficient Condition for Pfaffian Graphs on the Torus.
Graphs Comb., 2017

Efficient Graph Edit Distance Computation and Verification via Anchor-aware Lower Bound Estimation.
CoRR, 2017

2016
Reliability measures in relation to the h-extra edge-connectivity of folded hypercubes.
Theor. Comput. Sci., 2016

Computing Connected Components with linear communication cost in pregel-like systems.
Proceedings of the 32nd IEEE International Conference on Data Engineering, 2016

2014
On Minimum Wiener Polarity Index of Unicyclic Graphs with Prescribed Maximum Degree.
J. Appl. Math., 2014

2013
Probabilistic k-Skyband Operator over Sliding Windows.
Proceedings of the Web-Age Information Management - 14th International Conference, 2013

Object tracking with Kalman filter and discrete cosine transform.
Proceedings of the International Conference on Machine Learning and Cybernetics, 2013

Probabilistic Top-k Dominating Query over Sliding Windows.
Proceedings of the Web Technologies and Applications - 15th Asia-Pacific Web Conference, 2013

Parallel k-Skyband Computation on Multicore Architecture.
Proceedings of the Web Technologies and Applications - 15th Asia-Pacific Web Conference, 2013

2010
Robust Adaptive Tracking Control of the Underwater Robot with Input Nonlinearity Using Neural Networks.
Int. J. Comput. Intell. Syst., 2010

1985
Arbitrary Area Filling in a Fast Procedure.
Comput. Graph. Forum, 1985


  Loading...